./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-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 d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:47:35,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:47:35,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:47:35,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:47:35,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:47:35,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:47:35,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:47:35,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:47:35,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:47:35,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:47:35,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:47:35,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:47:35,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:47:35,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:47:35,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:47:35,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:47:35,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:47:35,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:47:35,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:47:35,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:47:35,530 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:47:35,533 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:47:35,533 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:47:35,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:47:35,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:47:35,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:47:35,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:47:35,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:47:35,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:47:35,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:47:35,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:47:35,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:47:35,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:47:35,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:47:35,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:47:35,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:47:35,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:47:35,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:47:35,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:47:35,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:47:35,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:47:35,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:47:35,536 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 -> d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 [2024-11-19 06:47:35,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:47:35,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:47:35,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:47:35,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:47:35,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:47:35,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2024-11-19 06:47:36,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:47:37,156 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:47:37,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2024-11-19 06:47:37,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7651179c5/eb12cb76499642bab9890f35ea865a95/FLAG211f98150 [2024-11-19 06:47:37,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7651179c5/eb12cb76499642bab9890f35ea865a95 [2024-11-19 06:47:37,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:47:37,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:47:37,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:37,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:47:37,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:47:37,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:37" (1/1) ... [2024-11-19 06:47:37,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37fba8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:37, skipping insertion in model container [2024-11-19 06:47:37,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:37" (1/1) ... [2024-11-19 06:47:37,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:47:37,866 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:37,937 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:37,942 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:37,942 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:37,943 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:37,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:37,987 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:47:37,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1841ed44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:37, skipping insertion in model container [2024-11-19 06:47:37,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:37,988 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:47:37,990 INFO L158 Benchmark]: Toolchain (without parser) took 452.07ms. Allocated memory is still 186.6MB. Free memory was 115.8MB in the beginning and 154.5MB in the end (delta: -38.7MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-19 06:47:37,990 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:47:37,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.04ms. Allocated memory is still 186.6MB. Free memory was 115.6MB in the beginning and 154.5MB in the end (delta: -38.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-19 06:47:37,991 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.11ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.04ms. Allocated memory is still 186.6MB. Free memory was 115.6MB in the beginning and 154.5MB in the end (delta: -38.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-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 d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:47:39,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:47:39,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:47:39,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:47:39,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:47:39,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:47:39,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:47:39,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:47:39,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:47:39,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:47:39,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:47:39,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:47:39,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:47:39,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:47:39,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:47:39,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:47:39,722 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:47:39,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:47:39,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:47:39,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:47:39,723 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:47:39,723 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:47:39,724 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:47:39,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:47:39,725 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:47:39,725 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:47:39,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:47:39,725 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:47:39,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:47:39,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:47:39,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:47:39,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:47:39,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:47:39,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:47:39,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:47:39,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:47:39,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:47:39,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:47:39,728 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:47:39,729 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:47:39,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:47:39,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:47:39,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:47:39,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:47:39,729 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 -> d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 [2024-11-19 06:47:39,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:47:39,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:47:39,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:47:40,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:47:40,001 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:47:40,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2024-11-19 06:47:41,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:47:41,502 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:47:41,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2024-11-19 06:47:41,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b029fe0/9131183aa7174b02a7b6f52c736dac3f/FLAG0f8d86e42 [2024-11-19 06:47:41,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b029fe0/9131183aa7174b02a7b6f52c736dac3f [2024-11-19 06:47:41,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:47:41,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:47:41,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:41,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:47:41,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:47:41,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:41" (1/1) ... [2024-11-19 06:47:41,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20fb76de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:41, skipping insertion in model container [2024-11-19 06:47:41,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:41" (1/1) ... [2024-11-19 06:47:41,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:47:41,874 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:41,923 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:41,930 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:41,932 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:41,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:41,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:41,956 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:47:41,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:47:41,992 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:42,013 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:42,018 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:42,020 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:42,021 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:42,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:42,028 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:47:42,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:42,131 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:47:42,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42 WrapperNode [2024-11-19 06:47:42,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:42,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:47:42,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:47:42,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:47:42,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,188 INFO L138 Inliner]: procedures = 176, calls = 104, calls flagged for inlining = 31, calls inlined = 14, statements flattened = 185 [2024-11-19 06:47:42,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:47:42,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:47:42,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:47:42,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:47:42,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,238 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-11-19 06:47:42,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:47:42,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:47:42,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:47:42,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:47:42,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (1/1) ... [2024-11-19 06:47:42,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:47:42,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:47:42,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:47:42,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:47:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:47:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:47:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 06:47:42,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 06:47:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:47:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:47:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:47:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:47:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2024-11-19 06:47:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2024-11-19 06:47:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:47:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:47:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 06:47:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 06:47:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:47:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:47:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:47:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:47:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:47:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:47:42,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:47:42,486 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:47:42,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:47:42,910 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-11-19 06:47:42,911 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:47:42,927 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:47:42,928 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 06:47:42,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:42 BoogieIcfgContainer [2024-11-19 06:47:42,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:47:42,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:47:42,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:47:42,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:47:42,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:47:41" (1/3) ... [2024-11-19 06:47:42,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2bc69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:42, skipping insertion in model container [2024-11-19 06:47:42,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:42" (2/3) ... [2024-11-19 06:47:42,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2bc69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:42, skipping insertion in model container [2024-11-19 06:47:42,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:42" (3/3) ... [2024-11-19 06:47:42,936 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test15-2.i [2024-11-19 06:47:42,948 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:47:42,949 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-19 06:47:42,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:47:42,998 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3bcf8b2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:47:42,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-19 06:47:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 128 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:47:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:47:43,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:43,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:43,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:43,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 505181993, now seen corresponding path program 1 times [2024-11-19 06:47:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:43,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122636542] [2024-11-19 06:47:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:43,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:43,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:43,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:43,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:47:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:43,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:47:43,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:43,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:43,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:43,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122636542] [2024-11-19 06:47:43,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122636542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:43,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:43,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:47:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287931742] [2024-11-19 06:47:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:43,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:43,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:43,225 INFO L87 Difference]: Start difference. First operand has 136 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 128 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:43,321 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2024-11-19 06:47:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:47:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 06:47:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:43,331 INFO L225 Difference]: With dead ends: 251 [2024-11-19 06:47:43,331 INFO L226 Difference]: Without dead ends: 249 [2024-11-19 06:47:43,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:43,335 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 116 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:43,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 551 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:47:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-19 06:47:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 138. [2024-11-19 06:47:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:47:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2024-11-19 06:47:43,375 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 11 [2024-11-19 06:47:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:43,376 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2024-11-19 06:47:43,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2024-11-19 06:47:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:47:43,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:43,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:43,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:47:43,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:43,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:43,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1392685674, now seen corresponding path program 1 times [2024-11-19 06:47:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:43,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88508116] [2024-11-19 06:47:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:43,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:43,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:43,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:43,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:47:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:43,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:47:43,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:43,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:43,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:43,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88508116] [2024-11-19 06:47:43,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88508116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:43,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:43,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:47:43,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741582121] [2024-11-19 06:47:43,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:43,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:47:43,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:43,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:47:43,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:47:43,682 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:43,985 INFO L93 Difference]: Finished difference Result 228 states and 253 transitions. [2024-11-19 06:47:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:47:43,985 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 06:47:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:43,987 INFO L225 Difference]: With dead ends: 228 [2024-11-19 06:47:43,987 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 06:47:43,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:47:43,988 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 93 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:43,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 437 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:47:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 06:47:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 134. [2024-11-19 06:47:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 126 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:47:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2024-11-19 06:47:44,001 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 11 [2024-11-19 06:47:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:44,001 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-19 06:47:44,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2024-11-19 06:47:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:47:44,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:44,004 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:44,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:47:44,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:44,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:44,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1151011886, now seen corresponding path program 1 times [2024-11-19 06:47:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:44,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141462460] [2024-11-19 06:47:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:44,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:44,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:44,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:44,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:47:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:44,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:47:44,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:47:44,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:44,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:44,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141462460] [2024-11-19 06:47:44,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141462460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:44,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:44,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:47:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565823179] [2024-11-19 06:47:44,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:44,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:44,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:44,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:44,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:44,281 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:47:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:44,352 INFO L93 Difference]: Finished difference Result 234 states and 270 transitions. [2024-11-19 06:47:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:47:44,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-19 06:47:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:44,354 INFO L225 Difference]: With dead ends: 234 [2024-11-19 06:47:44,354 INFO L226 Difference]: Without dead ends: 234 [2024-11-19 06:47:44,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:44,355 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 101 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:44,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 501 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:47:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-19 06:47:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 138. [2024-11-19 06:47:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 80 states have (on average 1.7375) internal successors, (139), 129 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:47:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2024-11-19 06:47:44,362 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 17 [2024-11-19 06:47:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:44,362 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2024-11-19 06:47:44,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:47:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2024-11-19 06:47:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:47:44,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:44,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:44,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 06:47:44,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:44,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1122382735, now seen corresponding path program 1 times [2024-11-19 06:47:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940238173] [2024-11-19 06:47:44,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:44,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:44,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:44,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:44,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:47:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:44,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:47:44,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:47:44,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:47:44,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:44,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940238173] [2024-11-19 06:47:44,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940238173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:47:44,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:44,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-19 06:47:44,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369603115] [2024-11-19 06:47:44,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:44,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:44,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:44,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:44,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:44,707 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:47:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:44,737 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2024-11-19 06:47:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:47:44,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-19 06:47:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:44,738 INFO L225 Difference]: With dead ends: 137 [2024-11-19 06:47:44,738 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 06:47:44,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:44,739 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 111 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:44,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 430 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:47:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 06:47:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-19 06:47:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.725) internal successors, (138), 128 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:47:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2024-11-19 06:47:44,745 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 17 [2024-11-19 06:47:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:44,746 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2024-11-19 06:47:44,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:47:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2024-11-19 06:47:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:47:44,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:44,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:44,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:47:44,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:44,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:44,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash -434126201, now seen corresponding path program 1 times [2024-11-19 06:47:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:44,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245677796] [2024-11-19 06:47:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:44,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:44,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:44,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:44,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:47:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:44,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:47:44,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:45,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:47:45,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:45,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245677796] [2024-11-19 06:47:45,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245677796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:47:45,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:45,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-19 06:47:45,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085306781] [2024-11-19 06:47:45,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:45,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:47:45,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:45,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:47:45,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:47:45,230 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:45,519 INFO L93 Difference]: Finished difference Result 346 states and 385 transitions. [2024-11-19 06:47:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:47:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2024-11-19 06:47:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:45,522 INFO L225 Difference]: With dead ends: 346 [2024-11-19 06:47:45,522 INFO L226 Difference]: Without dead ends: 346 [2024-11-19 06:47:45,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:47:45,523 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 667 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:45,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 659 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:47:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-19 06:47:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 167. [2024-11-19 06:47:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 106 states have (on average 1.7452830188679245) internal successors, (185), 153 states have internal predecessors, (185), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-19 06:47:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2024-11-19 06:47:45,537 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 18 [2024-11-19 06:47:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:45,537 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2024-11-19 06:47:45,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2024-11-19 06:47:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:47:45,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:45,538 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:45,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:45,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:45,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:45,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash -573010125, now seen corresponding path program 1 times [2024-11-19 06:47:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:45,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314617167] [2024-11-19 06:47:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:45,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:45,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:45,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:45,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:47:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:45,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:47:45,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:45,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:45,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:45,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314617167] [2024-11-19 06:47:45,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314617167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:47:45,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2024-11-19 06:47:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127621146] [2024-11-19 06:47:45,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:45,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:47:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:45,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:47:45,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:47:45,973 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:47:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:46,319 INFO L93 Difference]: Finished difference Result 235 states and 281 transitions. [2024-11-19 06:47:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:47:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-19 06:47:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:46,321 INFO L225 Difference]: With dead ends: 235 [2024-11-19 06:47:46,321 INFO L226 Difference]: Without dead ends: 235 [2024-11-19 06:47:46,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:47:46,321 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 117 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:46,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 361 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:47:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-19 06:47:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 182. [2024-11-19 06:47:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 120 states have (on average 1.7416666666666667) internal successors, (209), 166 states have internal predecessors, (209), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2024-11-19 06:47:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 233 transitions. [2024-11-19 06:47:46,339 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 233 transitions. Word has length 19 [2024-11-19 06:47:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:46,340 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 233 transitions. [2024-11-19 06:47:46,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:47:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 233 transitions. [2024-11-19 06:47:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:47:46,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:46,341 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:46,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:47:46,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:46,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:46,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 934541684, now seen corresponding path program 1 times [2024-11-19 06:47:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203510894] [2024-11-19 06:47:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:46,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:46,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:46,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:46,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:47:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:46,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:47:46,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:46,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:46,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203510894] [2024-11-19 06:47:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203510894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:47:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528901405] [2024-11-19 06:47:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:46,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:46,627 INFO L87 Difference]: Start difference. First operand 182 states and 233 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:47:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:46,650 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2024-11-19 06:47:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:47:46,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-19 06:47:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:46,651 INFO L225 Difference]: With dead ends: 144 [2024-11-19 06:47:46,651 INFO L226 Difference]: Without dead ends: 140 [2024-11-19 06:47:46,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:46,652 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:46,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:47:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-19 06:47:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-19 06:47:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.6588235294117648) internal successors, (141), 130 states have internal predecessors, (141), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 06:47:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2024-11-19 06:47:46,659 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 19 [2024-11-19 06:47:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:46,661 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2024-11-19 06:47:46,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:47:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2024-11-19 06:47:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:47:46,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:46,662 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:46,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:47:46,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:46,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:46,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:46,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1508180184, now seen corresponding path program 1 times [2024-11-19 06:47:46,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:46,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536713251] [2024-11-19 06:47:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:46,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:46,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:46,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:46,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:47:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:46,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:47:46,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:46,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:46,948 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-19 06:47:46,967 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:47:46,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 06:47:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-19 06:47:46,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:47:47,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:47,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536713251] [2024-11-19 06:47:47,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536713251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:47:47,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-19 06:47:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284278530] [2024-11-19 06:47:47,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:47,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:47:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:47:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-19 06:47:47,085 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:47:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:47,457 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2024-11-19 06:47:47,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:47:47,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2024-11-19 06:47:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:47,459 INFO L225 Difference]: With dead ends: 175 [2024-11-19 06:47:47,459 INFO L226 Difference]: Without dead ends: 175 [2024-11-19 06:47:47,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-11-19 06:47:47,459 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 102 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:47,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 436 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 367 Invalid, 0 Unknown, 189 Unchecked, 0.3s Time] [2024-11-19 06:47:47,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-19 06:47:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 156. [2024-11-19 06:47:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 states have internal predecessors, (169), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-19 06:47:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2024-11-19 06:47:47,465 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 22 [2024-11-19 06:47:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:47,466 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2024-11-19 06:47:47,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:47:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2024-11-19 06:47:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:47:47,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:47,467 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:47,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:47,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:47,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:47,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:47,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1508180185, now seen corresponding path program 1 times [2024-11-19 06:47:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:47,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645316660] [2024-11-19 06:47:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:47,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:47,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:47,670 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:47,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:47:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:47,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:47:47,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:47,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:47:47,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:47,863 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-19 06:47:47,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:47,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:47,895 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:47,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:47:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-19 06:47:47,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:48,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645316660] [2024-11-19 06:47:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645316660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:47:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [791468702] [2024-11-19 06:47:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:48,039 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:47:48,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:47:48,042 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:47:48,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-19 06:47:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:48,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:47:48,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:48,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:47:48,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:48,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:48,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:48,241 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:48,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:47:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-19 06:47:48,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:48,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [791468702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:47:48,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-19 06:47:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503272469] [2024-11-19 06:47:48,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:48,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:47:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:48,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:47:48,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-19 06:47:48,329 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:47:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:49,049 INFO L93 Difference]: Finished difference Result 279 states and 320 transitions. [2024-11-19 06:47:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:47:49,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-19 06:47:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:49,051 INFO L225 Difference]: With dead ends: 279 [2024-11-19 06:47:49,051 INFO L226 Difference]: Without dead ends: 279 [2024-11-19 06:47:49,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:47:49,052 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 137 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:49,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 873 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 698 Invalid, 0 Unknown, 285 Unchecked, 0.7s Time] [2024-11-19 06:47:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-19 06:47:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 228. [2024-11-19 06:47:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 172 states have (on average 1.6744186046511629) internal successors, (288), 215 states have internal predecessors, (288), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-19 06:47:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 307 transitions. [2024-11-19 06:47:49,058 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 307 transitions. Word has length 22 [2024-11-19 06:47:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:49,058 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 307 transitions. [2024-11-19 06:47:49,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:47:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 307 transitions. [2024-11-19 06:47:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:47:49,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:49,059 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:49,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-19 06:47:49,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:49,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:49,461 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:49,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash -906909162, now seen corresponding path program 1 times [2024-11-19 06:47:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353316008] [2024-11-19 06:47:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:49,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:49,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:49,465 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:49,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:47:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:49,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:47:49,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:49,588 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_19| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_19| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_19|)))) is different from true [2024-11-19 06:47:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:47:49,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:49,640 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-19 06:47:49,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-11-19 06:47:49,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353316008] [2024-11-19 06:47:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353316008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:47:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1910931116] [2024-11-19 06:47:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:49,717 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:47:49,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:47:49,719 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:47:49,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-19 06:47:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:49,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:47:49,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:47:49,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:50,005 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-19 06:47:50,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-11-19 06:47:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1910931116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:47:50,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:50,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-19 06:47:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802456552] [2024-11-19 06:47:50,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:50,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:47:50,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:50,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:47:50,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:47:50,088 INFO L87 Difference]: Start difference. First operand 228 states and 307 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:50,694 INFO L93 Difference]: Finished difference Result 302 states and 387 transitions. [2024-11-19 06:47:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:47:50,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2024-11-19 06:47:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:50,696 INFO L225 Difference]: With dead ends: 302 [2024-11-19 06:47:50,696 INFO L226 Difference]: Without dead ends: 297 [2024-11-19 06:47:50,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-11-19 06:47:50,698 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 281 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:50,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 699 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 536 Invalid, 0 Unknown, 230 Unchecked, 0.5s Time] [2024-11-19 06:47:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-19 06:47:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 225. [2024-11-19 06:47:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 169 states have (on average 1.680473372781065) internal successors, (284), 212 states have internal predecessors, (284), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-19 06:47:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 303 transitions. [2024-11-19 06:47:50,705 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 303 transitions. Word has length 21 [2024-11-19 06:47:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:50,705 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 303 transitions. [2024-11-19 06:47:50,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 303 transitions. [2024-11-19 06:47:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:47:50,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:50,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:50,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-19 06:47:50,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:51,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:51,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:51,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash -288771175, now seen corresponding path program 1 times [2024-11-19 06:47:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:51,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98047984] [2024-11-19 06:47:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:51,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:51,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:51,112 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:51,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:47:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:51,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:47:51,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:47:51,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:51,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:51,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98047984] [2024-11-19 06:47:51,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98047984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:51,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:51,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:47:51,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050913197] [2024-11-19 06:47:51,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:51,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:51,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:51,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:51,185 INFO L87 Difference]: Start difference. First operand 225 states and 303 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:47:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:51,212 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2024-11-19 06:47:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:47:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-19 06:47:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:51,214 INFO L225 Difference]: With dead ends: 145 [2024-11-19 06:47:51,214 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 06:47:51,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:51,214 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:51,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:47:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 06:47:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-19 06:47:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.59375) internal successors, (153), 134 states have internal predecessors, (153), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 164 transitions. [2024-11-19 06:47:51,218 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 164 transitions. Word has length 22 [2024-11-19 06:47:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:51,218 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 164 transitions. [2024-11-19 06:47:51,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:47:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2024-11-19 06:47:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:47:51,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:51,221 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:51,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 06:47:51,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:51,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:51,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2114757105, now seen corresponding path program 1 times [2024-11-19 06:47:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:51,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192163446] [2024-11-19 06:47:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:51,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:51,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:51,423 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:51,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:47:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:51,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:47:51,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:51,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:47:51,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-19 06:47:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:47:51,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:51,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:51,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192163446] [2024-11-19 06:47:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192163446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:51,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:47:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742843704] [2024-11-19 06:47:51,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:51,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:47:51,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:51,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:47:51,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:47:51,512 INFO L87 Difference]: Start difference. First operand 143 states and 164 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:47:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:51,593 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2024-11-19 06:47:51,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:47:51,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-19 06:47:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:51,594 INFO L225 Difference]: With dead ends: 152 [2024-11-19 06:47:51,594 INFO L226 Difference]: Without dead ends: 152 [2024-11-19 06:47:51,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:47:51,595 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:51,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 617 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:47:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-19 06:47:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2024-11-19 06:47:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 100 states have (on average 1.57) internal successors, (157), 137 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2024-11-19 06:47:51,600 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 27 [2024-11-19 06:47:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:51,600 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2024-11-19 06:47:51,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:47:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2024-11-19 06:47:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:47:51,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:51,601 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:51,604 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 (15)] Ended with exit code 0 [2024-11-19 06:47:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:51,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:51,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:51,802 INFO L85 PathProgramCache]: Analyzing trace with hash 307302642, now seen corresponding path program 1 times [2024-11-19 06:47:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379114369] [2024-11-19 06:47:51,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:51,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:51,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:51,804 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:51,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:47:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:51,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:47:51,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:47:52,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:47:52,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:52,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379114369] [2024-11-19 06:47:52,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379114369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:47:52,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:52,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-19 06:47:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34613944] [2024-11-19 06:47:52,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:52,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:47:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:47:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:47:52,240 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:52,508 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2024-11-19 06:47:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:47:52,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2024-11-19 06:47:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:52,509 INFO L225 Difference]: With dead ends: 146 [2024-11-19 06:47:52,509 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 06:47:52,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:47:52,510 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 108 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:52,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 447 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:47:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 06:47:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-19 06:47:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.55) internal successors, (155), 136 states have internal predecessors, (155), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2024-11-19 06:47:52,513 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 27 [2024-11-19 06:47:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:52,513 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2024-11-19 06:47:52,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2024-11-19 06:47:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:47:52,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:52,514 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:52,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 06:47:52,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:52,717 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:52,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1132887579, now seen corresponding path program 1 times [2024-11-19 06:47:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289537511] [2024-11-19 06:47:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:52,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:52,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:52,719 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:52,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 06:47:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:52,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:47:52,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:52,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:52,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:47:52,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:47:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:47:52,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:52,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:52,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289537511] [2024-11-19 06:47:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289537511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:52,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:52,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:47:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766376467] [2024-11-19 06:47:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:52,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:47:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:52,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:47:52,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:47:52,817 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:47:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:53,033 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2024-11-19 06:47:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:47:53,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-19 06:47:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:53,034 INFO L225 Difference]: With dead ends: 150 [2024-11-19 06:47:53,034 INFO L226 Difference]: Without dead ends: 150 [2024-11-19 06:47:53,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:47:53,035 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:53,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 456 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:47:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-19 06:47:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2024-11-19 06:47:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 139 states have internal predecessors, (159), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2024-11-19 06:47:53,038 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 28 [2024-11-19 06:47:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:53,038 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2024-11-19 06:47:53,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:47:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2024-11-19 06:47:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:47:53,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:53,039 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:53,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 06:47:53,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:53,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:53,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1132887580, now seen corresponding path program 1 times [2024-11-19 06:47:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041000154] [2024-11-19 06:47:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:53,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:53,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:53,241 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:53,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 06:47:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:53,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:47:53,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:53,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:47:53,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:47:53,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:47:53,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 06:47:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:47:53,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:53,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041000154] [2024-11-19 06:47:53,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041000154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:53,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:53,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:47:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646876157] [2024-11-19 06:47:53,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:53,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:47:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:47:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:47:53,385 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:47:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:53,609 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2024-11-19 06:47:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:47:53,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-19 06:47:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:53,613 INFO L225 Difference]: With dead ends: 149 [2024-11-19 06:47:53,613 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 06:47:53,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:47:53,615 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:53,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 616 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:47:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 06:47:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-19 06:47:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 103 states have (on average 1.5339805825242718) internal successors, (158), 139 states have internal predecessors, (158), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2024-11-19 06:47:53,621 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 28 [2024-11-19 06:47:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:53,621 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2024-11-19 06:47:53,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:47:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2024-11-19 06:47:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:47:53,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:53,622 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:53,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 06:47:53,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:53,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:53,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:53,823 INFO L85 PathProgramCache]: Analyzing trace with hash 936374074, now seen corresponding path program 1 times [2024-11-19 06:47:53,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:53,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019016049] [2024-11-19 06:47:53,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:53,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:53,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:53,824 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:53,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 06:47:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:53,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:47:53,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:53,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:47:53,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:47:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:47:53,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:53,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:53,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019016049] [2024-11-19 06:47:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019016049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:53,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:47:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250974663] [2024-11-19 06:47:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:53,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:47:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:47:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:47:53,924 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:47:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:54,024 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2024-11-19 06:47:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:47:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-19 06:47:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:54,025 INFO L225 Difference]: With dead ends: 144 [2024-11-19 06:47:54,025 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 06:47:54,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:47:54,025 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:54,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 627 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:47:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 06:47:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-19 06:47:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.52) internal successors, (152), 134 states have internal predecessors, (152), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2024-11-19 06:47:54,028 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 28 [2024-11-19 06:47:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:54,028 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2024-11-19 06:47:54,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:47:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2024-11-19 06:47:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:47:54,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:54,029 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:54,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:54,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:54,229 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:47:54,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2078238173, now seen corresponding path program 1 times [2024-11-19 06:47:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:54,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670981999] [2024-11-19 06:47:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:54,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:54,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:54,231 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:54,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 06:47:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:54,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:47:54,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:54,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:47:54,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:54,391 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-19 06:47:54,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:54,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:54,428 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-19 06:47:54,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 06:47:54,458 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-19 06:47:54,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:54,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:54,481 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:54,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:47:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-19 06:47:54,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:58,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:58,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670981999] [2024-11-19 06:47:58,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670981999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:47:58,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1105626877] [2024-11-19 06:47:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:58,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:47:58,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:47:58,683 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:47:58,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-19 06:47:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:58,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:47:58,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:58,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:47:58,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:58,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:58,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:58,912 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-19 06:47:58,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 06:47:58,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:58,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:58,963 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:58,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:47:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-19 06:47:58,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:59,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1105626877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:47:59,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:59,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-19 06:47:59,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887161537] [2024-11-19 06:47:59,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:59,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:47:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:59,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:47:59,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=70, Unknown=3, NotChecked=34, Total=132 [2024-11-19 06:47:59,144 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:47:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:59,637 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2024-11-19 06:47:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:47:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-19 06:47:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:59,638 INFO L225 Difference]: With dead ends: 167 [2024-11-19 06:47:59,638 INFO L226 Difference]: Without dead ends: 167 [2024-11-19 06:47:59,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=32, Invalid=105, Unknown=3, NotChecked=42, Total=182 [2024-11-19 06:47:59,639 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 149 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:59,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 349 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 403 Invalid, 0 Unknown, 346 Unchecked, 0.4s Time] [2024-11-19 06:47:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-19 06:47:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2024-11-19 06:47:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.51) internal successors, (151), 133 states have internal predecessors, (151), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2024-11-19 06:47:59,641 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 30 [2024-11-19 06:47:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:59,641 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2024-11-19 06:47:59,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:47:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2024-11-19 06:47:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:47:59,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:59,642 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:59,645 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 (20)] Ended with exit code 0 [2024-11-19 06:47:59,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-19 06:48:00,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 06:48:00,046 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:48:00,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1895723159, now seen corresponding path program 1 times [2024-11-19 06:48:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:00,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061719451] [2024-11-19 06:48:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:00,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:00,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:00,047 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:00,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 06:48:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:00,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:48:00,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:00,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:48:00,174 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-19 06:48:00,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 06:48:00,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-19 06:48:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:00,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:00,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:00,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061719451] [2024-11-19 06:48:00,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061719451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:00,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:00,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2024-11-19 06:48:00,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607203500] [2024-11-19 06:48:00,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:00,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:48:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:48:00,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:48:00,472 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:48:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:00,857 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2024-11-19 06:48:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:48:00,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-11-19 06:48:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:00,858 INFO L225 Difference]: With dead ends: 170 [2024-11-19 06:48:00,858 INFO L226 Difference]: Without dead ends: 170 [2024-11-19 06:48:00,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:48:00,859 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 182 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:00,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 450 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:48:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-19 06:48:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 146. [2024-11-19 06:48:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 136 states have internal predecessors, (154), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:48:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 165 transitions. [2024-11-19 06:48:00,862 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 165 transitions. Word has length 31 [2024-11-19 06:48:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:00,862 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 165 transitions. [2024-11-19 06:48:00,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:48:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 165 transitions. [2024-11-19 06:48:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:48:00,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:00,863 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:00,866 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 (22)] Forceful destruction successful, exit code 0 [2024-11-19 06:48:01,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:01,063 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:48:01,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash 27091421, now seen corresponding path program 1 times [2024-11-19 06:48:01,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:01,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060519016] [2024-11-19 06:48:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:01,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:01,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:01,065 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:01,066 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 (23)] Waiting until timeout for monitored process [2024-11-19 06:48:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:01,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:48:01,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:48:01,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:48:01,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060519016] [2024-11-19 06:48:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060519016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:48:01,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:48:01,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:48:01,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381495974] [2024-11-19 06:48:01,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:48:01,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:48:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:01,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:48:01,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:48:01,142 INFO L87 Difference]: Start difference. First operand 146 states and 165 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:48:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:01,284 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2024-11-19 06:48:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:48:01,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-11-19 06:48:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:01,285 INFO L225 Difference]: With dead ends: 169 [2024-11-19 06:48:01,285 INFO L226 Difference]: Without dead ends: 169 [2024-11-19 06:48:01,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:48:01,285 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 116 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:01,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 200 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:48:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-19 06:48:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2024-11-19 06:48:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 135 states have internal predecessors, (153), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:48:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2024-11-19 06:48:01,288 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 32 [2024-11-19 06:48:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:01,288 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2024-11-19 06:48:01,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:48:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2024-11-19 06:48:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:48:01,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:01,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:01,293 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 (23)] Forceful destruction successful, exit code 0 [2024-11-19 06:48:01,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:01,490 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:48:01,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:01,490 INFO L85 PathProgramCache]: Analyzing trace with hash 27091422, now seen corresponding path program 1 times [2024-11-19 06:48:01,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:01,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232285601] [2024-11-19 06:48:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:01,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:01,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:01,493 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:01,494 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 (24)] Waiting until timeout for monitored process [2024-11-19 06:48:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:01,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:48:01,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:48:01,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:01,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-19 06:48:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:48:01,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232285601] [2024-11-19 06:48:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232285601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:01,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:01,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-19 06:48:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490671892] [2024-11-19 06:48:01,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:01,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:48:01,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:01,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:48:01,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:48:01,824 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:48:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:02,201 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2024-11-19 06:48:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:48:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 32 [2024-11-19 06:48:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:02,202 INFO L225 Difference]: With dead ends: 144 [2024-11-19 06:48:02,202 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 06:48:02,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:48:02,203 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 214 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:02,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 589 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:48:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 06:48:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-19 06:48:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 134 states have internal predecessors, (152), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:48:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2024-11-19 06:48:02,205 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 32 [2024-11-19 06:48:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:02,205 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2024-11-19 06:48:02,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:48:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2024-11-19 06:48:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:48:02,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:02,205 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:02,210 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 (24)] Ended with exit code 0 [2024-11-19 06:48:02,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:02,409 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:48:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 723829370, now seen corresponding path program 1 times [2024-11-19 06:48:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361383681] [2024-11-19 06:48:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:02,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:02,411 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:02,411 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 (25)] Waiting until timeout for monitored process [2024-11-19 06:48:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:02,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:48:02,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:06,745 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_27| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_36| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 1))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~intf~2#1.base_36|)) (= (_ bv0 1) (bvadd v_DerPreprocessor_6 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_27| v_DerPreprocessor_6) |v_ULTIMATE.start_entry_point_~intf~2#1.base_36| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~hdev~0#1.base_27|))) (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~intf~2#1.base_36| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~hdev~0#1.base_27| (_ bv0 1)) |c_#valid|))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_27|)))) (exists ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_27| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_27| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_27|))))) is different from true [2024-11-19 06:48:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:48:06,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:06,877 INFO L349 Elim1Store]: treesize reduction 86, result has 8.5 percent of original size [2024-11-19 06:48:06,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 154 [2024-11-19 06:48:15,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:15,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361383681] [2024-11-19 06:48:15,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361383681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:48:15,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1009380926] [2024-11-19 06:48:15,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:15,044 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:48:15,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:48:15,046 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:48:15,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-19 06:48:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:15,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 06:48:15,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:27,951 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)) (_ bv0 1)) (exists ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_39| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~hdev~0#1.base_29| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29| (_ bv0 32))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~intf~2#1.base_39|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~intf~2#1.base_39| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29| (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29| (_ bv1 1)) |v_ULTIMATE.start_entry_point_~intf~2#1.base_39| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29|) (_ bv0 1))))) is different from true [2024-11-19 06:48:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:48:27,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:36,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-19 06:48:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1009380926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:48:44,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:44,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2024-11-19 06:48:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565472062] [2024-11-19 06:48:44,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:44,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 06:48:44,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:44,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 06:48:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=587, Unknown=12, NotChecked=102, Total=812 [2024-11-19 06:48:44,691 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:48:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:50,343 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2024-11-19 06:48:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:48:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2024-11-19 06:48:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:50,344 INFO L225 Difference]: With dead ends: 146 [2024-11-19 06:48:50,344 INFO L226 Difference]: Without dead ends: 132 [2024-11-19 06:48:50,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=176, Invalid=1079, Unknown=13, NotChecked=138, Total=1406 [2024-11-19 06:48:50,345 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 119 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 19 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:50,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 879 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 883 Invalid, 7 Unknown, 276 Unchecked, 1.3s Time] [2024-11-19 06:48:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-19 06:48:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-11-19 06:48:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 122 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:48:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2024-11-19 06:48:50,348 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 33 [2024-11-19 06:48:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:50,348 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2024-11-19 06:48:50,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:48:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2024-11-19 06:48:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:48:50,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:50,349 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:50,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-19 06:48:50,552 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 (25)] Forceful destruction successful, exit code 0 [2024-11-19 06:48:50,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:50,751 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:48:50,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash 265052702, now seen corresponding path program 1 times [2024-11-19 06:48:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:50,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613917995] [2024-11-19 06:48:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:50,752 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:50,754 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 (27)] Waiting until timeout for monitored process [2024-11-19 06:48:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:50,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:48:50,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:50,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:48:50,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 06:48:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:48:50,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:48:51,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:51,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613917995] [2024-11-19 06:48:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613917995] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 06:48:51,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:48:51,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2024-11-19 06:48:51,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990788312] [2024-11-19 06:48:51,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:48:51,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:48:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:51,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:48:51,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:48:51,037 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:48:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:51,506 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2024-11-19 06:48:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:48:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-19 06:48:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:51,507 INFO L225 Difference]: With dead ends: 184 [2024-11-19 06:48:51,507 INFO L226 Difference]: Without dead ends: 184 [2024-11-19 06:48:51,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:48:51,507 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 182 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:51,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 409 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:48:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-19 06:48:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 129. [2024-11-19 06:48:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 121 states have internal predecessors, (137), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:48:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2024-11-19 06:48:51,510 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 34 [2024-11-19 06:48:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:51,510 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2024-11-19 06:48:51,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:48:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2024-11-19 06:48:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:48:51,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:51,510 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:51,515 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 (27)] Ended with exit code 0 [2024-11-19 06:48:51,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:51,711 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:48:51,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash 265052703, now seen corresponding path program 1 times [2024-11-19 06:48:51,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:51,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007920025] [2024-11-19 06:48:51,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:51,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:51,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:51,713 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:51,713 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 (28)] Waiting until timeout for monitored process [2024-11-19 06:48:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:51,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:48:51,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:51,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:48:51,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:48:51,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 06:48:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:48:52,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:52,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-19 06:48:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:48:52,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007920025] [2024-11-19 06:48:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007920025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:52,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2024-11-19 06:48:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833881440] [2024-11-19 06:48:52,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:52,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 06:48:52,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:52,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 06:48:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:48:52,464 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:48:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:53,571 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2024-11-19 06:48:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:48:53,572 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-19 06:48:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:53,573 INFO L225 Difference]: With dead ends: 174 [2024-11-19 06:48:53,573 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 06:48:53,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:48:53,573 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 392 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:53,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 925 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 06:48:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 06:48:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2024-11-19 06:48:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.511111111111111) internal successors, (136), 120 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:48:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2024-11-19 06:48:53,576 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 34 [2024-11-19 06:48:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:53,576 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2024-11-19 06:48:53,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:48:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2024-11-19 06:48:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:48:53,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:53,577 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:53,581 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 (28)] Ended with exit code 0 [2024-11-19 06:48:53,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:53,778 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:48:53,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash -373300797, now seen corresponding path program 1 times [2024-11-19 06:48:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:53,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169197603] [2024-11-19 06:48:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:53,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:53,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:53,781 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:53,782 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 (29)] Waiting until timeout for monitored process [2024-11-19 06:48:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:53,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-19 06:48:53,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:53,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:48:54,015 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 06:48:54,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 06:48:54,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:48:54,194 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-19 06:48:54,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 06:48:54,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:48:54,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:48:54,467 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:48:54,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2024-11-19 06:48:54,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:48:54,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 06:48:54,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2024-11-19 06:48:54,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:48:54,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2024-11-19 06:48:54,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:48:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:48:54,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:55,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|))) (and (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_371))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse1 .cse2))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse3)) (select |c_#length| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_370))) (store .cse4 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse4 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse1 |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse3)))) (forall ((v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_371))) (store .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse1 .cse2))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse3))) (bvule (bvadd (_ bv7 32) .cse5) (bvadd (_ bv8 32) .cse5)))))) is different from false [2024-11-19 06:48:55,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))) (and (forall ((v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_371))) (store .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))) (bvule (bvadd (_ bv7 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_371))) (store .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5)) (select |c_#length| (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_370))) (store .cse7 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse7 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))))))) is different from false [2024-11-19 06:48:55,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:48:55,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2024-11-19 06:48:55,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:48:55,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2024-11-19 06:48:55,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:48:55,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 580 treesize of output 576 [2024-11-19 06:48:55,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:48:55,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2048 treesize of output 1990 [2024-11-19 06:48:55,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 276 [2024-11-19 06:48:55,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 308 [2024-11-19 06:48:56,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 203 [2024-11-19 06:49:01,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 201 [2024-11-19 06:49:01,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:01,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 66 [2024-11-19 06:49:01,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:01,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 404 treesize of output 390 [2024-11-19 06:49:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 228 [2024-11-19 06:49:01,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 68 [2024-11-19 06:49:02,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 71 [2024-11-19 06:49:02,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:02,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169197603] [2024-11-19 06:49:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169197603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:49:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1648496004] [2024-11-19 06:49:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:02,775 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:49:02,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:49:02,776 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:49:02,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-19 06:49:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:02,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-19 06:49:02,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:02,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:49:03,015 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 06:49:03,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 06:49:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:49:03,110 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-19 06:49:03,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 06:49:03,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:49:03,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:49:03,341 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:49:03,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2024-11-19 06:49:03,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:49:03,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 06:49:03,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2024-11-19 06:49:03,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:03,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2024-11-19 06:49:03,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:49:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:49:03,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:06,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:06,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 66 [2024-11-19 06:49:06,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:06,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 404 treesize of output 390 [2024-11-19 06:49:06,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 228 [2024-11-19 06:49:06,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 89 [2024-11-19 06:49:07,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:07,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2024-11-19 06:49:07,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:07,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2024-11-19 06:49:07,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:07,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 388 treesize of output 386 [2024-11-19 06:49:07,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:07,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4096 treesize of output 3974 [2024-11-19 06:49:07,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 276 [2024-11-19 06:49:07,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 308 [2024-11-19 06:49:11,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 179 [2024-11-19 06:49:12,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2024-11-19 06:49:12,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 71 [2024-11-19 06:49:13,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1648496004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:49:13,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:49:13,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2024-11-19 06:49:13,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950408409] [2024-11-19 06:49:13,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:49:13,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 06:49:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:13,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 06:49:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1137, Unknown=26, NotChecked=138, Total=1406 [2024-11-19 06:49:13,058 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:49:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:15,764 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2024-11-19 06:49:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:49:15,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-19 06:49:15,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:15,766 INFO L225 Difference]: With dead ends: 151 [2024-11-19 06:49:15,766 INFO L226 Difference]: Without dead ends: 151 [2024-11-19 06:49:15,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=239, Invalid=1723, Unknown=26, NotChecked=174, Total=2162 [2024-11-19 06:49:15,766 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 192 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:15,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 975 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 06:49:15,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-19 06:49:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2024-11-19 06:49:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.5) internal successors, (135), 119 states have internal predecessors, (135), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:49:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2024-11-19 06:49:15,769 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 35 [2024-11-19 06:49:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:15,769 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2024-11-19 06:49:15,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:49:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2024-11-19 06:49:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:49:15,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:15,769 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:15,773 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 (29)] Forceful destruction successful, exit code 0 [2024-11-19 06:49:15,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-19 06:49:16,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 06:49:16,170 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-19 06:49:16,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:16,171 INFO L85 PathProgramCache]: Analyzing trace with hash -373300798, now seen corresponding path program 1 times [2024-11-19 06:49:16,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:16,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794568598] [2024-11-19 06:49:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:16,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:16,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:16,173 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:16,175 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 (31)] Waiting until timeout for monitored process [2024-11-19 06:49:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:16,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 06:49:16,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:16,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:49:16,358 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 06:49:16,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 06:49:16,516 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2024-11-19 06:49:16,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2024-11-19 06:49:16,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:49:16,861 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:49:16,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2024-11-19 06:49:16,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 31 [2024-11-19 06:49:16,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:49:17,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:49:17,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:17,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 33 [2024-11-19 06:49:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:49:17,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:17,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_439))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32)) |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|)))))) is different from false [2024-11-19 06:49:17,608 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1) v_ArrVal_439))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32)) |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-19 06:49:17,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:17,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2024-11-19 06:49:17,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:17,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 382 [2024-11-19 06:49:17,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 194 [2024-11-19 06:49:17,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 225