./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 Calling Ultimate with: /usr/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/busybox-1.22.0/dirname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:34:38,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:34:38,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:34:38,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:34:38,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:34:38,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:34:38,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:34:38,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:34:38,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:34:38,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:34:38,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:34:38,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:34:38,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:34:38,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:34:38,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:34:38,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:34:38,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:34:38,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:34:38,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:34:39,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:34:39,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:34:39,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:34:39,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:34:39,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:34:39,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:34:39,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:34:39,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:34:39,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:34:39,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:34:39,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:34:39,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:34:39,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:34:39,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:34:39,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:34:39,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:34:39,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:34:39,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:34:39,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:34:39,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:34:39,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:34:39,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:34:39,025 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-02-15 13:34:39,054 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:34:39,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:34:39,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:34:39,055 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:34:39,056 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:34:39,056 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:34:39,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:34:39,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:34:39,057 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:34:39,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:34:39,058 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:34:39,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:34:39,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:34:39,058 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:34:39,058 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:34:39,059 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:34:39,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:34:39,059 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:34:39,059 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:34:39,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:34:39,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:34:39,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:34:39,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:34:39,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:34:39,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:34:39,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:34:39,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:34:39,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:34:39,064 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:34:39,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:34:39,064 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:34:39,065 INFO L138 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.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2023-02-15 13:34:39,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:34:39,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:34:39,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:34:39,239 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:34:39,239 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:34:39,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-02-15 13:34:40,189 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:34:40,454 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:34:40,454 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-02-15 13:34:40,469 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0a66376/641c8afd004c49908edabf5666bb34b1/FLAG52cb7d491 [2023-02-15 13:34:40,483 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0a66376/641c8afd004c49908edabf5666bb34b1 [2023-02-15 13:34:40,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:34:40,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:34:40,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:40,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:34:40,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:34:40,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:40" (1/1) ... [2023-02-15 13:34:40,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f1e6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:40, skipping insertion in model container [2023-02-15 13:34:40,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:40" (1/1) ... [2023-02-15 13:34:40,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:34:40,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:34:40,861 WARN L623 FunctionHandler]: Unknown extern function dirname [2023-02-15 13:34:40,862 WARN L623 FunctionHandler]: Unknown extern function puts [2023-02-15 13:34:40,864 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-15 13:34:40,898 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 13:34:40,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:40,926 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-15 13:34:40,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@742b555f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:40, skipping insertion in model container [2023-02-15 13:34:40,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:40,927 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 13:34:40,928 INFO L158 Benchmark]: Toolchain (without parser) took 440.88ms. Allocated memory is still 155.2MB. Free memory was 114.8MB in the beginning and 96.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 13:34:40,928 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:34:40,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.89ms. Allocated memory is still 155.2MB. Free memory was 114.8MB in the beginning and 96.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 13:34:40,929 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.89ms. Allocated memory is still 155.2MB. Free memory was 114.8MB in the beginning and 96.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1162]: 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: /usr/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/busybox-1.22.0/dirname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:34:42,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:34:42,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:34:42,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:34:42,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:34:42,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:34:42,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:34:42,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:34:42,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:34:42,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:34:42,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:34:42,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:34:42,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:34:42,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:34:42,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:34:42,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:34:42,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:34:42,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:34:42,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:34:42,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:34:42,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:34:42,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:34:42,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:34:42,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:34:42,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:34:42,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:34:42,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:34:42,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:34:42,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:34:42,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:34:42,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:34:42,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:34:42,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:34:42,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:34:42,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:34:42,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:34:42,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:34:42,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:34:42,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:34:42,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:34:42,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:34:42,579 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-02-15 13:34:42,603 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:34:42,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:34:42,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:34:42,604 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:34:42,605 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:34:42,605 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:34:42,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:34:42,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:34:42,606 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:34:42,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:34:42,606 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:34:42,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:34:42,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:34:42,607 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:34:42,607 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:34:42,607 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:34:42,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:34:42,607 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:34:42,607 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:34:42,608 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:34:42,608 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:34:42,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:34:42,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:34:42,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:34:42,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:34:42,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:34:42,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:34:42,609 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:34:42,609 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:34:42,609 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:34:42,609 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:34:42,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:34:42,610 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:34:42,610 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:34:42,610 INFO L138 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.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2023-02-15 13:34:42,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:34:42,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:34:42,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:34:42,931 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:34:42,931 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:34:42,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-02-15 13:34:43,986 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:34:44,257 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:34:44,257 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-02-15 13:34:44,288 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007ccc614/bd625c5ad61440b892f31417c9e9587b/FLAG6b259f91d [2023-02-15 13:34:44,306 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007ccc614/bd625c5ad61440b892f31417c9e9587b [2023-02-15 13:34:44,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:34:44,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:34:44,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:44,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:34:44,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:34:44,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:44" (1/1) ... [2023-02-15 13:34:44,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64261489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:44, skipping insertion in model container [2023-02-15 13:34:44,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:44" (1/1) ... [2023-02-15 13:34:44,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:34:44,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:34:44,803 WARN L623 FunctionHandler]: Unknown extern function dirname [2023-02-15 13:34:44,803 WARN L623 FunctionHandler]: Unknown extern function puts [2023-02-15 13:34:44,805 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-15 13:34:44,855 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 13:34:44,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:44,883 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 13:34:44,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:34:44,921 WARN L623 FunctionHandler]: Unknown extern function dirname [2023-02-15 13:34:44,922 WARN L623 FunctionHandler]: Unknown extern function puts [2023-02-15 13:34:44,922 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-15 13:34:44,950 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 13:34:44,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:44,963 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:34:44,994 WARN L623 FunctionHandler]: Unknown extern function dirname [2023-02-15 13:34:44,994 WARN L623 FunctionHandler]: Unknown extern function puts [2023-02-15 13:34:44,995 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-15 13:34:45,006 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 13:34:45,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:45,082 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:34:45,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45 WrapperNode [2023-02-15 13:34:45,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:45,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:34:45,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:34:45,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:34:45,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,134 INFO L138 Inliner]: procedures = 350, calls = 111, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 257 [2023-02-15 13:34:45,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:34:45,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:34:45,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:34:45,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:34:45,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,159 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:34:45,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:34:45,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:34:45,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:34:45,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (1/1) ... [2023-02-15 13:34:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:34:45,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:45,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:34:45,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:34:45,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-15 13:34:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 13:34:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 13:34:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:34:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-15 13:34:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:34:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 13:34:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2023-02-15 13:34:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:34:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-02-15 13:34:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:34:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:34:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:34:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:34:45,389 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:34:45,391 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:34:46,081 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:34:46,086 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:34:46,086 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2023-02-15 13:34:46,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:46 BoogieIcfgContainer [2023-02-15 13:34:46,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:34:46,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:34:46,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:34:46,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:34:46,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:34:44" (1/3) ... [2023-02-15 13:34:46,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb41a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:46, skipping insertion in model container [2023-02-15 13:34:46,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:45" (2/3) ... [2023-02-15 13:34:46,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb41a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:46, skipping insertion in model container [2023-02-15 13:34:46,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:46" (3/3) ... [2023-02-15 13:34:46,093 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2023-02-15 13:34:46,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:34:46,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 73 error locations. [2023-02-15 13:34:46,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:34:46,139 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17c6a597, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:34:46,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2023-02-15 13:34:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 102 states have (on average 1.9509803921568627) internal successors, (199), 175 states have internal predecessors, (199), 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) [2023-02-15 13:34:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:34:46,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:46,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:34:46,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 13:34:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:46,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993473270] [2023-02-15 13:34:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:46,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:46,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:46,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:46,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 13:34:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:46,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:34:46,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:46,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:34:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:46,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:46,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:46,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993473270] [2023-02-15 13:34:46,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993473270] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:46,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:46,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296745019] [2023-02-15 13:34:46,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:46,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:46,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:46,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:46,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:46,353 INFO L87 Difference]: Start difference. First operand has 178 states, 102 states have (on average 1.9509803921568627) internal successors, (199), 175 states have internal predecessors, (199), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:46,611 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2023-02-15 13:34:46,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:46,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 13:34:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:46,620 INFO L225 Difference]: With dead ends: 188 [2023-02-15 13:34:46,620 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 13:34:46,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:46,623 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 160 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:46,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 144 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:34:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 13:34:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2023-02-15 13:34:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 99 states have (on average 1.8484848484848484) internal successors, (183), 167 states have internal predecessors, (183), 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) [2023-02-15 13:34:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 185 transitions. [2023-02-15 13:34:46,648 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 185 transitions. Word has length 3 [2023-02-15 13:34:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:46,648 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 185 transitions. [2023-02-15 13:34:46,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2023-02-15 13:34:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:34:46,649 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:46,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:34:46,660 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 [2023-02-15 13:34:46,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:46,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:46,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 13:34:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:46,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387037389] [2023-02-15 13:34:46,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:46,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:46,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:46,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:46,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 13:34:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:46,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:34:46,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:46,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:34:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:46,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:46,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:46,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387037389] [2023-02-15 13:34:46,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387037389] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:46,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:46,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:46,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691175639] [2023-02-15 13:34:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:46,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:46,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:46,942 INFO L87 Difference]: Start difference. First operand 170 states and 185 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:47,279 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2023-02-15 13:34:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 13:34:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:47,280 INFO L225 Difference]: With dead ends: 169 [2023-02-15 13:34:47,280 INFO L226 Difference]: Without dead ends: 169 [2023-02-15 13:34:47,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:47,281 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 9 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:47,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 288 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:34:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-15 13:34:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2023-02-15 13:34:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 99 states have (on average 1.8383838383838385) internal successors, (182), 166 states have internal predecessors, (182), 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) [2023-02-15 13:34:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2023-02-15 13:34:47,291 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 3 [2023-02-15 13:34:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:47,291 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2023-02-15 13:34:47,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2023-02-15 13:34:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:34:47,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:47,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:34:47,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:47,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:47,500 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2023-02-15 13:34:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:47,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587750358] [2023-02-15 13:34:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:47,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:47,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:47,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:47,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 13:34:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:47,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:34:47,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:47,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:34:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:47,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:47,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:47,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587750358] [2023-02-15 13:34:47,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587750358] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:47,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:47,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:34:47,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258706585] [2023-02-15 13:34:47,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:47,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:34:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:47,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:34:47,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:34:47,667 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:48,113 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2023-02-15 13:34:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:34:48,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 13:34:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:48,114 INFO L225 Difference]: With dead ends: 173 [2023-02-15 13:34:48,115 INFO L226 Difference]: Without dead ends: 173 [2023-02-15 13:34:48,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:34:48,115 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:48,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 396 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:34:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-15 13:34:48,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2023-02-15 13:34:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 101 states have (on average 1.8217821782178218) internal successors, (184), 168 states have internal predecessors, (184), 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) [2023-02-15 13:34:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 186 transitions. [2023-02-15 13:34:48,132 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 186 transitions. Word has length 6 [2023-02-15 13:34:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:48,135 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 186 transitions. [2023-02-15 13:34:48,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2023-02-15 13:34:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 13:34:48,136 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:48,136 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:48,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:48,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:48,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2023-02-15 13:34:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:48,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533598661] [2023-02-15 13:34:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:48,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:48,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:48,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:48,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 13:34:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:48,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 13:34:48,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:48,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:34:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:48,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:48,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:48,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533598661] [2023-02-15 13:34:48,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533598661] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:48,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:34:48,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-15 13:34:48,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379870543] [2023-02-15 13:34:48,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:48,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:34:48,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:34:48,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:34:48,948 INFO L87 Difference]: Start difference. First operand 171 states and 186 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:51,005 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2023-02-15 13:34:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:34:51,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 13:34:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:51,006 INFO L225 Difference]: With dead ends: 177 [2023-02-15 13:34:51,006 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 13:34:51,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:34:51,007 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 14 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:51,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 724 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 13:34:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 13:34:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-02-15 13:34:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.7592592592592593) internal successors, (190), 174 states have internal predecessors, (190), 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) [2023-02-15 13:34:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 192 transitions. [2023-02-15 13:34:51,014 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 192 transitions. Word has length 10 [2023-02-15 13:34:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:51,015 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 192 transitions. [2023-02-15 13:34:51,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2023-02-15 13:34:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:34:51,016 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:51,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:51,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-02-15 13:34:51,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:51,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1324461056, now seen corresponding path program 1 times [2023-02-15 13:34:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266379033] [2023-02-15 13:34:51,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:51,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:51,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:51,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:51,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 13:34:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:51,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:34:51,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:51,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:51,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:51,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266379033] [2023-02-15 13:34:51,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266379033] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:51,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:34:51,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 13:34:51,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10338387] [2023-02-15 13:34:51,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:51,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:34:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:51,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:34:51,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:34:51,428 INFO L87 Difference]: Start difference. First operand 177 states and 192 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:34:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:51,623 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2023-02-15 13:34:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:34:51,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-02-15 13:34:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:51,624 INFO L225 Difference]: With dead ends: 197 [2023-02-15 13:34:51,625 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 13:34:51,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:34:51,625 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 18 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:51,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 902 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 13:34:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2023-02-15 13:34:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 128 states have (on average 1.640625) internal successors, (210), 194 states have internal predecessors, (210), 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) [2023-02-15 13:34:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 212 transitions. [2023-02-15 13:34:51,639 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 212 transitions. Word has length 25 [2023-02-15 13:34:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:51,640 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 212 transitions. [2023-02-15 13:34:51,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:34:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 212 transitions. [2023-02-15 13:34:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:34:51,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:51,641 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:51,666 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 [2023-02-15 13:34:51,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:51,850 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:51,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash -536579439, now seen corresponding path program 2 times [2023-02-15 13:34:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:51,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4195326] [2023-02-15 13:34:51,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:34:51,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:51,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:51,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 13:34:51,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 13:34:51,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:34:51,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:34:51,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:51,961 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:34:51,962 INFO L350 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 13:34:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-15 13:34:51,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:51,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:51,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4195326] [2023-02-15 13:34:51,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4195326] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:51,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:51,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413900761] [2023-02-15 13:34:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:51,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:51,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:51,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:51,982 INFO L87 Difference]: Start difference. First operand 197 states and 212 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2023-02-15 13:34:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:52,235 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2023-02-15 13:34:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:52,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2023-02-15 13:34:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:52,237 INFO L225 Difference]: With dead ends: 208 [2023-02-15 13:34:52,237 INFO L226 Difference]: Without dead ends: 208 [2023-02-15 13:34:52,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:52,238 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 145 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:52,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 147 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:34:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-15 13:34:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2023-02-15 13:34:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 128 states have (on average 1.6015625) internal successors, (205), 189 states have internal predecessors, (205), 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) [2023-02-15 13:34:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2023-02-15 13:34:52,242 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 45 [2023-02-15 13:34:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:52,243 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2023-02-15 13:34:52,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2023-02-15 13:34:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2023-02-15 13:34:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:34:52,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:52,244 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:52,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:52,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:52,445 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:52,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash -536579438, now seen corresponding path program 1 times [2023-02-15 13:34:52,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:52,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921515388] [2023-02-15 13:34:52,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:52,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:52,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:52,448 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:52,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 13:34:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:52,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 13:34:52,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:52,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:52,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:52,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921515388] [2023-02-15 13:34:52,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921515388] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:52,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:34:52,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-15 13:34:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026222244] [2023-02-15 13:34:52,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:52,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 13:34:52,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:52,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 13:34:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-02-15 13:34:52,903 INFO L87 Difference]: Start difference. First operand 192 states and 207 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:34:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:53,323 INFO L93 Difference]: Finished difference Result 200 states and 215 transitions. [2023-02-15 13:34:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:34:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-02-15 13:34:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:53,324 INFO L225 Difference]: With dead ends: 200 [2023-02-15 13:34:53,324 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 13:34:53,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-02-15 13:34:53,325 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 6 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:53,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2657 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:34:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 13:34:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-02-15 13:34:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.5661764705882353) internal successors, (213), 197 states have internal predecessors, (213), 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) [2023-02-15 13:34:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 215 transitions. [2023-02-15 13:34:53,329 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 215 transitions. Word has length 45 [2023-02-15 13:34:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:53,329 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 215 transitions. [2023-02-15 13:34:53,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:34:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 215 transitions. [2023-02-15 13:34:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 13:34:53,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:53,330 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:53,341 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 [2023-02-15 13:34:53,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:53,542 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1584587084, now seen corresponding path program 2 times [2023-02-15 13:34:53,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:53,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160282475] [2023-02-15 13:34:53,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:34:53,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 [2023-02-15 13:34:53,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:53,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:53,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 13:34:53,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 13:34:53,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:34:53,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:34:53,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:53,706 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 13:34:53,706 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 13:34:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 13:34:53,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:53,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:53,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160282475] [2023-02-15 13:34:53,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160282475] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:53,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:53,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:34:53,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62759281] [2023-02-15 13:34:53,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:53,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:34:53,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:53,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:34:53,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:34:53,759 INFO L87 Difference]: Start difference. First operand 200 states and 215 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-02-15 13:34:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:54,423 INFO L93 Difference]: Finished difference Result 319 states and 347 transitions. [2023-02-15 13:34:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:34:54,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 53 [2023-02-15 13:34:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:54,425 INFO L225 Difference]: With dead ends: 319 [2023-02-15 13:34:54,425 INFO L226 Difference]: Without dead ends: 319 [2023-02-15 13:34:54,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:34:54,425 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 430 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:54,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 475 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:34:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-02-15 13:34:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 263. [2023-02-15 13:34:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 200 states have (on average 1.67) internal successors, (334), 260 states have internal predecessors, (334), 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) [2023-02-15 13:34:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 336 transitions. [2023-02-15 13:34:54,430 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 336 transitions. Word has length 53 [2023-02-15 13:34:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:54,431 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 336 transitions. [2023-02-15 13:34:54,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-02-15 13:34:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 336 transitions. [2023-02-15 13:34:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 13:34:54,431 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:54,432 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:54,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:54,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:54,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 448239575, now seen corresponding path program 1 times [2023-02-15 13:34:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:54,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055589542] [2023-02-15 13:34:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:54,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:54,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:54,642 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:54,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 13:34:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:54,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 13:34:54,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:55,003 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 13:34:55,004 INFO L350 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 13:34:55,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:34:55,176 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 13:34:55,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2023-02-15 13:34:55,192 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:34:55,192 INFO L350 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 [2023-02-15 13:34:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 13:34:55,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:55,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:55,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055589542] [2023-02-15 13:34:55,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055589542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:55,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:55,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:34:55,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646014063] [2023-02-15 13:34:55,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:55,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:34:55,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:55,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:34:55,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:34:55,240 INFO L87 Difference]: Start difference. First operand 263 states and 336 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2023-02-15 13:34:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:56,754 INFO L93 Difference]: Finished difference Result 235 states and 252 transitions. [2023-02-15 13:34:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:34:56,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 56 [2023-02-15 13:34:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:56,756 INFO L225 Difference]: With dead ends: 235 [2023-02-15 13:34:56,756 INFO L226 Difference]: Without dead ends: 235 [2023-02-15 13:34:56,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:34:56,756 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 397 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:56,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 418 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 13:34:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-02-15 13:34:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 212. [2023-02-15 13:34:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 150 states have (on average 1.5466666666666666) internal successors, (232), 209 states have internal predecessors, (232), 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) [2023-02-15 13:34:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2023-02-15 13:34:56,760 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 56 [2023-02-15 13:34:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:56,760 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2023-02-15 13:34:56,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2023-02-15 13:34:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2023-02-15 13:34:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 13:34:56,761 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:56,761 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:56,784 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 [2023-02-15 13:34:56,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:56,962 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:56,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:56,962 INFO L85 PathProgramCache]: Analyzing trace with hash 451837722, now seen corresponding path program 1 times [2023-02-15 13:34:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:56,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217754785] [2023-02-15 13:34:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:56,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:56,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:56,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:56,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 13:34:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:57,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:34:57,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:57,382 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 13:34:57,382 INFO L350 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:34:57,404 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:34:57,404 INFO L350 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 1 case distinctions, treesize of input 9 treesize of output 19 [2023-02-15 13:34:57,500 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:34:57,501 INFO L350 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 17 treesize of output 23 [2023-02-15 13:34:57,526 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:34:57,527 INFO L350 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 [2023-02-15 13:34:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 13:34:57,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:57,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:57,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217754785] [2023-02-15 13:34:57,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217754785] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:57,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:57,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:34:57,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388620503] [2023-02-15 13:34:57,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:57,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:34:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:34:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:34:57,658 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-02-15 13:34:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:58,741 INFO L93 Difference]: Finished difference Result 229 states and 246 transitions. [2023-02-15 13:34:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:34:58,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 59 [2023-02-15 13:34:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:58,742 INFO L225 Difference]: With dead ends: 229 [2023-02-15 13:34:58,743 INFO L226 Difference]: Without dead ends: 229 [2023-02-15 13:34:58,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:34:58,743 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 369 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:58,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 363 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 13:34:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-15 13:34:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2023-02-15 13:34:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 155 states have (on average 1.5290322580645161) internal successors, (237), 213 states have internal predecessors, (237), 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) [2023-02-15 13:34:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 239 transitions. [2023-02-15 13:34:58,747 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 239 transitions. Word has length 59 [2023-02-15 13:34:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:58,747 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 239 transitions. [2023-02-15 13:34:58,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-02-15 13:34:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 239 transitions. [2023-02-15 13:34:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 13:34:58,748 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:58,748 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:58,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:58,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:58,959 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:34:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 270059549, now seen corresponding path program 1 times [2023-02-15 13:34:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:34:58,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797032635] [2023-02-15 13:34:58,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:58,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:34:58,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:34:58,962 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:34:58,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 13:34:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:59,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:34:59,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:59,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:34:59,377 INFO L350 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 16 treesize of output 12 [2023-02-15 13:34:59,468 INFO L321 Elim1Store]: treesize reduction 30, result has 28.6 percent of original size [2023-02-15 13:34:59,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2023-02-15 13:34:59,534 INFO L350 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 25 treesize of output 11 [2023-02-15 13:34:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 13:34:59,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:59,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:34:59,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797032635] [2023-02-15 13:34:59,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797032635] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:59,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:59,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:34:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756818758] [2023-02-15 13:34:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:59,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:34:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:34:59,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:34:59,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:34:59,547 INFO L87 Difference]: Start difference. First operand 216 states and 239 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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) [2023-02-15 13:35:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:35:00,055 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2023-02-15 13:35:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:35:00,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 62 [2023-02-15 13:35:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:35:00,057 INFO L225 Difference]: With dead ends: 214 [2023-02-15 13:35:00,057 INFO L226 Difference]: Without dead ends: 214 [2023-02-15 13:35:00,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:35:00,057 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 167 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:35:00,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 453 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:35:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-15 13:35:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-02-15 13:35:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 155 states have (on average 1.5096774193548388) internal successors, (234), 211 states have internal predecessors, (234), 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) [2023-02-15 13:35:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 236 transitions. [2023-02-15 13:35:00,061 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 236 transitions. Word has length 62 [2023-02-15 13:35:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:35:00,061 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 236 transitions. [2023-02-15 13:35:00,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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) [2023-02-15 13:35:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 236 transitions. [2023-02-15 13:35:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 13:35:00,061 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:35:00,061 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:35:00,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:35:00,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:35:00,262 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:35:00,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:35:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash 270059550, now seen corresponding path program 1 times [2023-02-15 13:35:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:35:00,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207536931] [2023-02-15 13:35:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:35:00,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:35:00,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:35:00,264 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:35:00,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 13:35:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:35:00,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 13:35:00,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:35:00,699 INFO L350 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 10 treesize of output 8 [2023-02-15 13:35:00,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:35:00,735 INFO L350 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 16 treesize of output 12 [2023-02-15 13:35:00,745 INFO L350 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 16 treesize of output 12 [2023-02-15 13:35:00,798 INFO L350 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 21 treesize of output 23 [2023-02-15 13:35:00,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 13:35:00,840 INFO L350 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 27 treesize of output 9 [2023-02-15 13:35:00,842 INFO L350 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 25 treesize of output 7 [2023-02-15 13:35:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 13:35:00,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:35:00,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:35:00,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207536931] [2023-02-15 13:35:00,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207536931] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:35:00,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:35:00,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:35:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22344522] [2023-02-15 13:35:00,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:35:00,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:35:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:35:00,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:35:00,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:35:00,857 INFO L87 Difference]: Start difference. First operand 214 states and 236 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2023-02-15 13:35:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:35:01,588 INFO L93 Difference]: Finished difference Result 213 states and 234 transitions. [2023-02-15 13:35:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:35:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 62 [2023-02-15 13:35:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:35:01,590 INFO L225 Difference]: With dead ends: 213 [2023-02-15 13:35:01,590 INFO L226 Difference]: Without dead ends: 213 [2023-02-15 13:35:01,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:35:01,590 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 162 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:35:01,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 455 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 13:35:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-15 13:35:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2023-02-15 13:35:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 155 states have (on average 1.4967741935483871) internal successors, (232), 210 states have internal predecessors, (232), 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) [2023-02-15 13:35:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 234 transitions. [2023-02-15 13:35:01,593 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 234 transitions. Word has length 62 [2023-02-15 13:35:01,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:35:01,594 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 234 transitions. [2023-02-15 13:35:01,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2023-02-15 13:35:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 234 transitions. [2023-02-15 13:35:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 13:35:01,594 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:35:01,594 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2023-02-15 13:35:01,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:35:01,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:35:01,803 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:35:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:35:01,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1209648968, now seen corresponding path program 1 times [2023-02-15 13:35:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:35:01,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015846308] [2023-02-15 13:35:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:35:01,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:35:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:35:01,805 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:35:01,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 13:35:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:35:02,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:35:02,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:35:02,291 INFO L350 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 10 treesize of output 8 [2023-02-15 13:35:02,331 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 13:35:02,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 13:35:02,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 13:35:02,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2023-02-15 13:35:02,526 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:35:02,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 13:35:02,555 INFO L350 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 42 treesize of output 15 [2023-02-15 13:35:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 13:35:02,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:35:02,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:35:02,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015846308] [2023-02-15 13:35:02,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015846308] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:35:02,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:35:02,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:35:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702453197] [2023-02-15 13:35:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:35:02,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:35:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:35:02,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:35:02,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:35:02,582 INFO L87 Difference]: Start difference. First operand 213 states and 234 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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) [2023-02-15 13:35:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:35:03,465 INFO L93 Difference]: Finished difference Result 236 states and 258 transitions. [2023-02-15 13:35:03,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:35:03,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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 66 [2023-02-15 13:35:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:35:03,466 INFO L225 Difference]: With dead ends: 236 [2023-02-15 13:35:03,466 INFO L226 Difference]: Without dead ends: 236 [2023-02-15 13:35:03,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:35:03,467 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 197 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:35:03,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 415 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 13:35:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-15 13:35:03,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 222. [2023-02-15 13:35:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 219 states have internal predecessors, (247), 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) [2023-02-15 13:35:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 249 transitions. [2023-02-15 13:35:03,470 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 249 transitions. Word has length 66 [2023-02-15 13:35:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:35:03,470 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 249 transitions. [2023-02-15 13:35:03,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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) [2023-02-15 13:35:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 249 transitions. [2023-02-15 13:35:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 13:35:03,471 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:35:03,471 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2023-02-15 13:35:03,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:35:03,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:35:03,682 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:35:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:35:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1209648969, now seen corresponding path program 1 times [2023-02-15 13:35:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:35:03,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373516052] [2023-02-15 13:35:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:35:03,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:35:03,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:35:03,684 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:35:03,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 13:35:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:35:04,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 13:35:04,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:35:04,167 INFO L350 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 10 treesize of output 8 [2023-02-15 13:35:04,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:35:04,199 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:35:04,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2023-02-15 13:35:04,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 13:35:04,239 INFO L350 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 16 treesize of output 12 [2023-02-15 13:35:04,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2023-02-15 13:35:04,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 13:35:04,406 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:35:04,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2023-02-15 13:35:04,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 13:35:04,482 INFO L350 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 40 treesize of output 13 [2023-02-15 13:35:04,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-02-15 13:35:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 13:35:04,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:35:04,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:35:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373516052] [2023-02-15 13:35:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373516052] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:35:04,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:35:04,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:35:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964717976] [2023-02-15 13:35:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:35:04,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:35:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:35:04,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:35:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:35:04,510 INFO L87 Difference]: Start difference. First operand 222 states and 249 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2023-02-15 13:35:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:35:05,588 INFO L93 Difference]: Finished difference Result 234 states and 253 transitions. [2023-02-15 13:35:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:35:05,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 66 [2023-02-15 13:35:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:35:05,589 INFO L225 Difference]: With dead ends: 234 [2023-02-15 13:35:05,589 INFO L226 Difference]: Without dead ends: 234 [2023-02-15 13:35:05,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 13:35:05,590 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 194 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:35:05,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 377 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 13:35:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-15 13:35:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 222. [2023-02-15 13:35:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.4817073170731707) internal successors, (243), 219 states have internal predecessors, (243), 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) [2023-02-15 13:35:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 245 transitions. [2023-02-15 13:35:05,593 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 245 transitions. Word has length 66 [2023-02-15 13:35:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:35:05,593 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 245 transitions. [2023-02-15 13:35:05,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2023-02-15 13:35:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 245 transitions. [2023-02-15 13:35:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 13:35:05,594 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:35:05,594 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 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, 1, 1] [2023-02-15 13:35:05,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:35:05,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:35:05,794 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:35:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:35:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash -249734821, now seen corresponding path program 1 times [2023-02-15 13:35:05,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:35:05,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782088376] [2023-02-15 13:35:05,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:35:05,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:35:05,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:35:05,796 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:35:05,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 13:35:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:35:06,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 13:35:06,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:35:06,416 INFO L350 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 10 treesize of output 8 [2023-02-15 13:35:06,458 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 13:35:06,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 13:35:06,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 13:35:06,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2023-02-15 13:35:06,684 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:35:06,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 13:35:06,769 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:35:06,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 13:35:06,811 INFO L350 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 42 treesize of output 15 [2023-02-15 13:35:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-02-15 13:35:06,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:35:08,986 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_995) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-02-15 13:35:09,017 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_994 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_994))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_995)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-02-15 13:35:09,047 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_994 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_994))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_995)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-02-15 13:35:09,075 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_994 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_993 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_993))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_994)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_995)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-02-15 13:35:09,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:35:09,110 INFO L350 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 116 treesize of output 78 [2023-02-15 13:35:09,116 INFO L350 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 3221 treesize of output 2564 [2023-02-15 13:35:09,120 INFO L350 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 2560 treesize of output 2056 [2023-02-15 13:35:09,123 INFO L350 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 2056 treesize of output 1580 [2023-02-15 13:35:09,130 INFO L350 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 1580 treesize of output 1524 [2023-02-15 13:36:18,944 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 37 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:36:19,014 INFO L321 Elim1Store]: treesize reduction 27, result has 55.7 percent of original size [2023-02-15 13:36:19,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 84 [2023-02-15 13:36:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2023-02-15 13:36:19,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:36:19,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782088376] [2023-02-15 13:36:19,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782088376] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:36:19,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:36:19,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-02-15 13:36:19,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043417803] [2023-02-15 13:36:19,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:36:19,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:36:19,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:36:19,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:36:19,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=164, Unknown=7, NotChecked=116, Total=342 [2023-02-15 13:36:19,050 INFO L87 Difference]: Start difference. First operand 222 states and 245 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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) [2023-02-15 13:36:20,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:36:20,616 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2023-02-15 13:36:20,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:36:20,616 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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 71 [2023-02-15 13:36:20,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:36:20,617 INFO L225 Difference]: With dead ends: 230 [2023-02-15 13:36:20,617 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 13:36:20,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=86, Invalid=229, Unknown=7, NotChecked=140, Total=462 [2023-02-15 13:36:20,619 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 170 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 703 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:36:20,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 859 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 604 Invalid, 0 Unknown, 703 Unchecked, 1.3s Time] [2023-02-15 13:36:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 13:36:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2023-02-15 13:36:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 218 states have internal predecessors, (241), 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) [2023-02-15 13:36:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2023-02-15 13:36:20,622 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 71 [2023-02-15 13:36:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:36:20,622 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2023-02-15 13:36:20,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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) [2023-02-15 13:36:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2023-02-15 13:36:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 13:36:20,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:36:20,623 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 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, 1, 1] [2023-02-15 13:36:20,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 13:36:20,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:36:20,840 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 13:36:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:36:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash -249734820, now seen corresponding path program 1 times [2023-02-15 13:36:20,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:36:20,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423031644] [2023-02-15 13:36:20,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:36:20,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:36:20,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:36:20,842 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:36:20,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 13:36:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:36:21,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 13:36:21,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:36:21,349 INFO L350 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 10 treesize of output 8 [2023-02-15 13:36:21,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:36:21,385 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:36:21,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2023-02-15 13:36:21,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 13:36:21,426 INFO L350 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 16 treesize of output 12 [2023-02-15 13:36:21,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2023-02-15 13:36:21,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 13:36:21,619 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:36:21,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2023-02-15 13:36:21,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 13:36:21,777 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:36:21,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2023-02-15 13:36:21,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 13:36:21,886 INFO L350 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 40 treesize of output 13 [2023-02-15 13:36:21,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-02-15 13:36:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 13:36:21,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:36:22,868 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-02-15 13:36:22,947 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd (_ bv1 64) .cse0 .cse3))))))) is different from false [2023-02-15 13:36:23,032 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd .cse0 (_ bv1 64) .cse3))))))) is different from false [2023-02-15 13:36:23,112 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1111) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1112))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1111) .cse3 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-02-15 13:36:23,244 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1111) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1112) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1112))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1111) .cse4 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-02-15 13:36:23,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1109 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1110))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1109) .cse2 v_ArrVal_1111) (select (select (store .cse3 .cse2 v_ArrVal_1112) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1114))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1109 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1110))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1112))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1109) .cse5 v_ArrVal_1111) .cse6 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-02-15 13:36:23,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:36:23,754 INFO L350 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 227 treesize of output 228 [2023-02-15 13:36:23,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:36:23,767 INFO L350 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 214 treesize of output 137 [2023-02-15 13:36:23,800 INFO L350 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 8639 treesize of output 6758 [2023-02-15 13:36:23,821 INFO L350 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 81915 treesize of output 79458 [2023-02-15 13:36:23,844 INFO L350 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 79454 treesize of output 72286 [2023-02-15 13:36:23,861 INFO L350 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 72286 treesize of output 70382 [2023-02-15 13:36:23,876 INFO L350 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 70382 treesize of output 61450 [2023-02-15 13:36:23,892 INFO L350 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 61450 treesize of output 58090 [2023-02-15 13:36:23,907 INFO L350 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 58090 treesize of output 47226 [2023-02-15 13:36:23,923 INFO L350 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 47226 treesize of output 40058