./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:05:46,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:05:46,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:05:47,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:05:47,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:05:47,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:05:47,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:05:47,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:05:47,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:05:47,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:05:47,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:05:47,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:05:47,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:05:47,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:05:47,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:05:47,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:05:47,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:05:47,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:05:47,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:05:47,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:05:47,059 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:05:47,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:05:47,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:05:47,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:05:47,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:05:47,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:05:47,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:05:47,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:05:47,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:05:47,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:05:47,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:05:47,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:05:47,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:05:47,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:05:47,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:05:47,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:05:47,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:05:47,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:05:47,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:05:47,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:05:47,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:05:47,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:05:47,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:05:47,101 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:05:47,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:05:47,103 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:05:47,103 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:05:47,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:05:47,104 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:05:47,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:05:47,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:05:47,105 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:05:47,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:05:47,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:05:47,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:05:47,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:05:47,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:05:47,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:05:47,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:05:47,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:05:47,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:05:47,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:05:47,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:05:47,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:05:47,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:05:47,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:05:47,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:05:47,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:05:47,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:05:47,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:05:47,109 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:05:47,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:05:47,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:05:47,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 ! call(reach_error())) ) 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 -> 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 [2022-07-14 00:05:47,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:05:47,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:05:47,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:05:47,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:05:47,377 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:05:47,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-07-14 00:05:47,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b960e2c4c/f83c77b9e6af4ffe8f350c79e9ecb318/FLAGc5e046eb6 [2022-07-14 00:05:47,990 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:05:47,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-07-14 00:05:48,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b960e2c4c/f83c77b9e6af4ffe8f350c79e9ecb318/FLAGc5e046eb6 [2022-07-14 00:05:48,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b960e2c4c/f83c77b9e6af4ffe8f350c79e9ecb318 [2022-07-14 00:05:48,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:05:48,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:05:48,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:05:48,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:05:48,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:05:48,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:05:48" (1/1) ... [2022-07-14 00:05:48,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb81e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:48, skipping insertion in model container [2022-07-14 00:05:48,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:05:48" (1/1) ... [2022-07-14 00:05:48,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:05:48,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:05:49,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2022-07-14 00:05:49,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:05:49,445 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:05:49,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2022-07-14 00:05:49,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:05:49,694 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:05:49,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49 WrapperNode [2022-07-14 00:05:49,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:05:49,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:05:49,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:05:49,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:05:49,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,859 INFO L137 Inliner]: procedures = 165, calls = 691, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1770 [2022-07-14 00:05:49,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:05:49,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:05:49,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:05:49,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:05:49,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:05:49,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:05:49,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:05:49,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:05:49,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (1/1) ... [2022-07-14 00:05:49,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:05:49,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:05:49,988 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) [2022-07-14 00:05:49,999 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 [2022-07-14 00:05:50,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2022-07-14 00:05:50,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2022-07-14 00:05:50,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 00:05:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2022-07-14 00:05:50,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2022-07-14 00:05:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2022-07-14 00:05:50,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2022-07-14 00:05:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2022-07-14 00:05:50,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2022-07-14 00:05:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:05:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:05:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:05:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:05:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:05:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-14 00:05:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-14 00:05:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-14 00:05:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-14 00:05:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2022-07-14 00:05:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2022-07-14 00:05:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-14 00:05:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-14 00:05:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-14 00:05:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-14 00:05:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 00:05:50,019 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 00:05:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 00:05:50,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 00:05:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:05:50,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:05:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-14 00:05:50,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-14 00:05:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-14 00:05:50,020 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-14 00:05:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:05:50,020 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:05:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2022-07-14 00:05:50,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2022-07-14 00:05:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2022-07-14 00:05:50,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2022-07-14 00:05:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:05:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:05:50,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:05:50,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:05:50,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:05:50,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:05:50,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:05:50,022 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2022-07-14 00:05:50,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2022-07-14 00:05:50,022 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-14 00:05:50,022 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-14 00:05:50,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:05:50,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-14 00:05:50,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-14 00:05:50,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:05:50,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 00:05:50,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 00:05:50,025 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2022-07-14 00:05:50,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2022-07-14 00:05:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:05:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:05:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 00:05:50,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 00:05:50,027 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-14 00:05:50,027 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-14 00:05:50,027 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-14 00:05:50,027 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-14 00:05:50,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:05:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-14 00:05:50,028 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-14 00:05:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:05:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:05:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-07-14 00:05:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-07-14 00:05:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 00:05:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 00:05:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-14 00:05:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-14 00:05:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-14 00:05:50,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-14 00:05:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:05:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2022-07-14 00:05:50,030 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2022-07-14 00:05:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 00:05:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 00:05:50,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 00:05:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-14 00:05:50,031 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-14 00:05:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:05:50,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:05:50,359 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:05:50,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:05:50,479 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:05:50,863 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-14 00:05:51,357 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:05:51,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:05:51,369 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 00:05:51,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:05:51 BoogieIcfgContainer [2022-07-14 00:05:51,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:05:51,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:05:51,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:05:51,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:05:51,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:05:48" (1/3) ... [2022-07-14 00:05:51,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da721a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:05:51, skipping insertion in model container [2022-07-14 00:05:51,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:49" (2/3) ... [2022-07-14 00:05:51,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da721a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:05:51, skipping insertion in model container [2022-07-14 00:05:51,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:05:51" (3/3) ... [2022-07-14 00:05:51,379 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-07-14 00:05:51,391 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:05:51,391 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:05:51,462 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:05:51,471 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67074004, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3021243f [2022-07-14 00:05:51,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:05:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2022-07-14 00:05:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 00:05:51,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:05:51,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:05:51,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:05:51,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:05:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash -60987296, now seen corresponding path program 1 times [2022-07-14 00:05:51,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:05:51,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080177366] [2022-07-14 00:05:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:05:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:05:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:05:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:05:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 00:05:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:05:51,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080177366] [2022-07-14 00:05:51,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080177366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:05:51,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:05:51,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:05:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810518789] [2022-07-14 00:05:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:05:51,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:05:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:05:51,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:05:51,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:05:51,902 INFO L87 Difference]: Start difference. First operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:05:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:05:53,121 INFO L93 Difference]: Finished difference Result 1626 states and 2252 transitions. [2022-07-14 00:05:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:05:53,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-07-14 00:05:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:05:53,153 INFO L225 Difference]: With dead ends: 1626 [2022-07-14 00:05:53,153 INFO L226 Difference]: Without dead ends: 1080 [2022-07-14 00:05:53,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:05:53,176 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 965 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:05:53,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1463 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-14 00:05:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-07-14 00:05:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 992. [2022-07-14 00:05:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 738 states have (on average 1.2764227642276422) internal successors, (942), 754 states have internal predecessors, (942), 185 states have call successors, (185), 69 states have call predecessors, (185), 68 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2022-07-14 00:05:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1307 transitions. [2022-07-14 00:05:53,272 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1307 transitions. Word has length 34 [2022-07-14 00:05:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:05:53,272 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1307 transitions. [2022-07-14 00:05:53,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 00:05:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1307 transitions. [2022-07-14 00:05:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 00:05:53,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:05:53,275 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:05:53,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:05:53,276 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:05:53,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:05:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -406405667, now seen corresponding path program 1 times [2022-07-14 00:05:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:05:53,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305324536] [2022-07-14 00:05:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:05:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:05:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:53,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:53,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:05:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:53,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:05:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:05:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 00:05:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:05:53,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305324536] [2022-07-14 00:05:53,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305324536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:05:53,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:05:53,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:05:53,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481111631] [2022-07-14 00:05:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:05:53,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:05:53,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:05:53,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:05:53,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:05:53,404 INFO L87 Difference]: Start difference. First operand 992 states and 1307 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:05:53,928 INFO L93 Difference]: Finished difference Result 1106 states and 1483 transitions. [2022-07-14 00:05:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:05:53,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-14 00:05:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:05:53,934 INFO L225 Difference]: With dead ends: 1106 [2022-07-14 00:05:53,934 INFO L226 Difference]: Without dead ends: 1093 [2022-07-14 00:05:53,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:05:53,936 INFO L413 NwaCegarLoop]: 639 mSDtfsCounter, 800 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:05:53,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 930 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:05:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2022-07-14 00:05:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 992. [2022-07-14 00:05:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 738 states have (on average 1.2750677506775068) internal successors, (941), 754 states have internal predecessors, (941), 185 states have call successors, (185), 69 states have call predecessors, (185), 68 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2022-07-14 00:05:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1306 transitions. [2022-07-14 00:05:53,976 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1306 transitions. Word has length 44 [2022-07-14 00:05:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:05:53,977 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1306 transitions. [2022-07-14 00:05:53,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1306 transitions. [2022-07-14 00:05:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 00:05:53,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:05:53,979 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:05:53,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:05:53,979 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:05:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:05:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash -349147365, now seen corresponding path program 1 times [2022-07-14 00:05:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:05:53,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043879132] [2022-07-14 00:05:53,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:05:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:05:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:05:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:05:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:54,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:05:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 00:05:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:05:54,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043879132] [2022-07-14 00:05:54,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043879132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:05:54,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:05:54,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:05:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050247708] [2022-07-14 00:05:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:05:54,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:05:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:05:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:05:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:05:54,181 INFO L87 Difference]: Start difference. First operand 992 states and 1306 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:05:55,174 INFO L93 Difference]: Finished difference Result 3133 states and 4280 transitions. [2022-07-14 00:05:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:05:55,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-14 00:05:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:05:55,186 INFO L225 Difference]: With dead ends: 3133 [2022-07-14 00:05:55,187 INFO L226 Difference]: Without dead ends: 2150 [2022-07-14 00:05:55,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:05:55,204 INFO L413 NwaCegarLoop]: 728 mSDtfsCounter, 969 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:05:55,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1468 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 00:05:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-07-14 00:05:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2000. [2022-07-14 00:05:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1487 states have (on average 1.2703429724277069) internal successors, (1889), 1519 states have internal predecessors, (1889), 366 states have call successors, (366), 137 states have call predecessors, (366), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-14 00:05:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2670 transitions. [2022-07-14 00:05:55,296 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2670 transitions. Word has length 44 [2022-07-14 00:05:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:05:55,296 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2670 transitions. [2022-07-14 00:05:55,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2670 transitions. [2022-07-14 00:05:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 00:05:55,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:05:55,299 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:05:55,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:05:55,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:05:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:05:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2061086592, now seen corresponding path program 1 times [2022-07-14 00:05:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:05:55,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022205880] [2022-07-14 00:05:55,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:05:55,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:05:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:05:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:55,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:05:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:55,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:05:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 00:05:55,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:05:55,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022205880] [2022-07-14 00:05:55,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022205880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:05:55,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:05:55,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:05:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443145744] [2022-07-14 00:05:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:05:55,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:05:55,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:05:55,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:05:55,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:05:55,442 INFO L87 Difference]: Start difference. First operand 2000 states and 2670 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:05:55,926 INFO L93 Difference]: Finished difference Result 2142 states and 2912 transitions. [2022-07-14 00:05:55,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:05:55,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-07-14 00:05:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:05:55,934 INFO L225 Difference]: With dead ends: 2142 [2022-07-14 00:05:55,935 INFO L226 Difference]: Without dead ends: 2139 [2022-07-14 00:05:55,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:05:55,936 INFO L413 NwaCegarLoop]: 623 mSDtfsCounter, 776 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:05:55,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 889 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:05:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2022-07-14 00:05:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1999. [2022-07-14 00:05:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1487 states have (on average 1.269670477471419) internal successors, (1888), 1518 states have internal predecessors, (1888), 365 states have call successors, (365), 137 states have call predecessors, (365), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-14 00:05:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2668 transitions. [2022-07-14 00:05:56,021 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2668 transitions. Word has length 45 [2022-07-14 00:05:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:05:56,021 INFO L495 AbstractCegarLoop]: Abstraction has 1999 states and 2668 transitions. [2022-07-14 00:05:56,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2668 transitions. [2022-07-14 00:05:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 00:05:56,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:05:56,023 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:05:56,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:05:56,024 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:05:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:05:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash -531067202, now seen corresponding path program 1 times [2022-07-14 00:05:56,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:05:56,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019320559] [2022-07-14 00:05:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:05:56,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:05:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:05:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:05:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:05:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 00:05:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:05:56,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019320559] [2022-07-14 00:05:56,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019320559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:05:56,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:05:56,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:05:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030541052] [2022-07-14 00:05:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:05:56,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:05:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:05:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:05:56,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:05:56,168 INFO L87 Difference]: Start difference. First operand 1999 states and 2668 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:05:56,752 INFO L93 Difference]: Finished difference Result 2141 states and 2910 transitions. [2022-07-14 00:05:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:05:56,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-07-14 00:05:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:05:56,761 INFO L225 Difference]: With dead ends: 2141 [2022-07-14 00:05:56,762 INFO L226 Difference]: Without dead ends: 2138 [2022-07-14 00:05:56,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:05:56,763 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 774 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:05:56,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 883 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:05:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-07-14 00:05:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1998. [2022-07-14 00:05:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1487 states have (on average 1.2689979825151312) internal successors, (1887), 1517 states have internal predecessors, (1887), 364 states have call successors, (364), 137 states have call predecessors, (364), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-14 00:05:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2666 transitions. [2022-07-14 00:05:56,830 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2666 transitions. Word has length 46 [2022-07-14 00:05:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:05:56,831 INFO L495 AbstractCegarLoop]: Abstraction has 1998 states and 2666 transitions. [2022-07-14 00:05:56,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2666 transitions. [2022-07-14 00:05:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 00:05:56,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:05:56,832 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:05:56,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:05:56,833 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:05:56,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:05:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash 716548675, now seen corresponding path program 1 times [2022-07-14 00:05:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:05:56,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11009389] [2022-07-14 00:05:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:05:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:05:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:05:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:05:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:05:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 00:05:56,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:05:56,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11009389] [2022-07-14 00:05:56,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11009389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:05:56,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:05:56,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:05:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369788303] [2022-07-14 00:05:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:05:56,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:05:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:05:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:05:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:05:56,956 INFO L87 Difference]: Start difference. First operand 1998 states and 2666 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:05:57,468 INFO L93 Difference]: Finished difference Result 2140 states and 2908 transitions. [2022-07-14 00:05:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:05:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-07-14 00:05:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:05:57,479 INFO L225 Difference]: With dead ends: 2140 [2022-07-14 00:05:57,479 INFO L226 Difference]: Without dead ends: 2137 [2022-07-14 00:05:57,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:05:57,481 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 770 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:05:57,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 883 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:05:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2022-07-14 00:05:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1997. [2022-07-14 00:05:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1487 states have (on average 1.2683254875588432) internal successors, (1886), 1516 states have internal predecessors, (1886), 363 states have call successors, (363), 137 states have call predecessors, (363), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-14 00:05:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2664 transitions. [2022-07-14 00:05:57,566 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2664 transitions. Word has length 47 [2022-07-14 00:05:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:05:57,566 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 2664 transitions. [2022-07-14 00:05:57,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2664 transitions. [2022-07-14 00:05:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 00:05:57,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:05:57,568 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:05:57,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:05:57,569 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:05:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:05:57,569 INFO L85 PathProgramCache]: Analyzing trace with hash 737940065, now seen corresponding path program 1 times [2022-07-14 00:05:57,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:05:57,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594440646] [2022-07-14 00:05:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:05:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:05:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:57,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:05:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:57,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:05:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:57,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:05:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 00:05:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:05:57,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594440646] [2022-07-14 00:05:57,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594440646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:05:57,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:05:57,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:05:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082945634] [2022-07-14 00:05:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:05:57,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:05:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:05:57,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:05:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:05:57,669 INFO L87 Difference]: Start difference. First operand 1997 states and 2664 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:05:58,230 INFO L93 Difference]: Finished difference Result 2139 states and 2906 transitions. [2022-07-14 00:05:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:05:58,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-07-14 00:05:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:05:58,240 INFO L225 Difference]: With dead ends: 2139 [2022-07-14 00:05:58,241 INFO L226 Difference]: Without dead ends: 2127 [2022-07-14 00:05:58,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:05:58,242 INFO L413 NwaCegarLoop]: 617 mSDtfsCounter, 767 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:05:58,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 880 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:05:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2022-07-14 00:05:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1987. [2022-07-14 00:05:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1478 states have (on average 1.2679296346414073) internal successors, (1874), 1506 states have internal predecessors, (1874), 362 states have call successors, (362), 137 states have call predecessors, (362), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-07-14 00:05:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2651 transitions. [2022-07-14 00:05:58,338 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2651 transitions. Word has length 48 [2022-07-14 00:05:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:05:58,339 INFO L495 AbstractCegarLoop]: Abstraction has 1987 states and 2651 transitions. [2022-07-14 00:05:58,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 00:05:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2651 transitions. [2022-07-14 00:05:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-14 00:05:58,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:05:58,349 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-07-14 00:05:58,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:05:58,349 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:05:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:05:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1153772682, now seen corresponding path program 1 times [2022-07-14 00:05:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:05:58,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357905844] [2022-07-14 00:05:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:05:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:05:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:05:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:05:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:05:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:05:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:05:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 00:05:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:05:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 00:05:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 00:05:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:05:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:05:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:05:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:05:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:05:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 00:05:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:05:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:05:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 00:05:58,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:05:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357905844] [2022-07-14 00:05:58,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357905844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:05:58,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:05:58,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:05:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119798059] [2022-07-14 00:05:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:05:58,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:05:58,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:05:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:05:58,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:05:58,607 INFO L87 Difference]: Start difference. First operand 1987 states and 2651 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:05:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:05:59,908 INFO L93 Difference]: Finished difference Result 5900 states and 7924 transitions. [2022-07-14 00:05:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:05:59,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2022-07-14 00:05:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:05:59,927 INFO L225 Difference]: With dead ends: 5900 [2022-07-14 00:05:59,927 INFO L226 Difference]: Without dead ends: 3922 [2022-07-14 00:05:59,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:05:59,936 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 1540 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 847 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 847 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:05:59,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 1763 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [847 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-14 00:05:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2022-07-14 00:06:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3516. [2022-07-14 00:06:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 2593 states have (on average 1.261473197069032) internal successors, (3271), 2651 states have internal predecessors, (3271), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2022-07-14 00:06:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4670 transitions. [2022-07-14 00:06:00,112 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4670 transitions. Word has length 153 [2022-07-14 00:06:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:00,112 INFO L495 AbstractCegarLoop]: Abstraction has 3516 states and 4670 transitions. [2022-07-14 00:06:00,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:06:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4670 transitions. [2022-07-14 00:06:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 00:06:00,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:00,121 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:00,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:06:00,121 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 425318257, now seen corresponding path program 1 times [2022-07-14 00:06:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:00,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762863720] [2022-07-14 00:06:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:06:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 00:06:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:06:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:06:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 00:06:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 00:06:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:06:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:06:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 00:06:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 00:06:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:06:00,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:00,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762863720] [2022-07-14 00:06:00,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762863720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:06:00,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:06:00,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:06:00,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604051960] [2022-07-14 00:06:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:06:00,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:06:00,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:00,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:06:00,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:06:00,423 INFO L87 Difference]: Start difference. First operand 3516 states and 4670 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:06:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:01,277 INFO L93 Difference]: Finished difference Result 7416 states and 9930 transitions. [2022-07-14 00:06:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:06:01,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-07-14 00:06:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:01,297 INFO L225 Difference]: With dead ends: 7416 [2022-07-14 00:06:01,297 INFO L226 Difference]: Without dead ends: 3916 [2022-07-14 00:06:01,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:06:01,309 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 867 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:01,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1379 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 00:06:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2022-07-14 00:06:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3520. [2022-07-14 00:06:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2597 states have (on average 1.261070465922218) internal successors, (3275), 2655 states have internal predecessors, (3275), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2022-07-14 00:06:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4674 transitions. [2022-07-14 00:06:01,439 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4674 transitions. Word has length 162 [2022-07-14 00:06:01,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:01,440 INFO L495 AbstractCegarLoop]: Abstraction has 3520 states and 4674 transitions. [2022-07-14 00:06:01,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:06:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4674 transitions. [2022-07-14 00:06:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 00:06:01,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:01,447 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:01,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:06:01,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash -632519821, now seen corresponding path program 1 times [2022-07-14 00:06:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:01,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360881576] [2022-07-14 00:06:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:01,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:06:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 00:06:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:06:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:06:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 00:06:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 00:06:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:06:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:06:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 00:06:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 00:06:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:06:01,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:01,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360881576] [2022-07-14 00:06:01,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360881576] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:01,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944018955] [2022-07-14 00:06:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:01,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:01,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:06:01,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:06:01,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 00:06:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:02,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:06:02,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:06:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-14 00:06:02,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:06:02,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944018955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:06:02,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:06:02,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-14 00:06:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273836492] [2022-07-14 00:06:02,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:06:02,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:06:02,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:02,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:06:02,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:06:02,224 INFO L87 Difference]: Start difference. First operand 3520 states and 4674 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:06:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:02,603 INFO L93 Difference]: Finished difference Result 9962 states and 13915 transitions. [2022-07-14 00:06:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:06:02,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-07-14 00:06:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:02,630 INFO L225 Difference]: With dead ends: 9962 [2022-07-14 00:06:02,631 INFO L226 Difference]: Without dead ends: 6458 [2022-07-14 00:06:02,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:06:02,643 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 852 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 3869 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:02,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 3869 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 00:06:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2022-07-14 00:06:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 3532. [2022-07-14 00:06:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 2609 states have (on average 1.2598696818704485) internal successors, (3287), 2667 states have internal predecessors, (3287), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2022-07-14 00:06:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4686 transitions. [2022-07-14 00:06:02,870 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4686 transitions. Word has length 162 [2022-07-14 00:06:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:02,871 INFO L495 AbstractCegarLoop]: Abstraction has 3532 states and 4686 transitions. [2022-07-14 00:06:02,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:06:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4686 transitions. [2022-07-14 00:06:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-14 00:06:02,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:02,878 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:02,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 00:06:03,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-14 00:06:03,100 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash 625799758, now seen corresponding path program 1 times [2022-07-14 00:06:03,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:03,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023025242] [2022-07-14 00:06:03,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:03,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:06:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 00:06:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:06:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:06:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 00:06:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 00:06:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 00:06:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:06:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:06:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:06:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 00:06:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:06:03,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:03,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023025242] [2022-07-14 00:06:03,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023025242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:03,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349149236] [2022-07-14 00:06:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:03,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:03,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:06:03,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:06:03,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 00:06:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:04,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 2118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 00:06:04,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:06:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:06:04,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:06:04,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349149236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:06:04,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:06:04,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-07-14 00:06:04,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777100163] [2022-07-14 00:06:04,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:06:04,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:06:04,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:04,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:06:04,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:06:04,113 INFO L87 Difference]: Start difference. First operand 3532 states and 4686 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 00:06:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:05,212 INFO L93 Difference]: Finished difference Result 14900 states and 20710 transitions. [2022-07-14 00:06:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 00:06:05,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 172 [2022-07-14 00:06:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:05,267 INFO L225 Difference]: With dead ends: 14900 [2022-07-14 00:06:05,267 INFO L226 Difference]: Without dead ends: 11384 [2022-07-14 00:06:05,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-07-14 00:06:05,280 INFO L413 NwaCegarLoop]: 1728 mSDtfsCounter, 1640 mSDsluCounter, 5450 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:05,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 7178 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:06:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11384 states. [2022-07-14 00:06:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11384 to 7096. [2022-07-14 00:06:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7096 states, 5241 states have (on average 1.2577752337340202) internal successors, (6592), 5365 states have internal predecessors, (6592), 1261 states have call successors, (1261), 514 states have call predecessors, (1261), 593 states have return successors, (1560), 1256 states have call predecessors, (1560), 1260 states have call successors, (1560) [2022-07-14 00:06:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 9413 transitions. [2022-07-14 00:06:05,770 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 9413 transitions. Word has length 172 [2022-07-14 00:06:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:05,770 INFO L495 AbstractCegarLoop]: Abstraction has 7096 states and 9413 transitions. [2022-07-14 00:06:05,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 00:06:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 9413 transitions. [2022-07-14 00:06:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-14 00:06:05,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:05,783 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:05,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 00:06:06,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-14 00:06:06,008 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -385317492, now seen corresponding path program 1 times [2022-07-14 00:06:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:06,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296468094] [2022-07-14 00:06:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:06,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:06:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 00:06:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 00:06:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 00:06:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 00:06:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 00:06:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 00:06:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:06:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:06:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:06:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 00:06:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-14 00:06:06,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:06,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296468094] [2022-07-14 00:06:06,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296468094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:06,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917612711] [2022-07-14 00:06:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:06,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:06:06,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:06:06,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 00:06:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:06,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-14 00:06:06,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:06:07,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:06:07,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:06:07,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:06:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-14 00:06:07,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:06:07,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917612711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:06:07,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:06:07,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2022-07-14 00:06:07,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949993659] [2022-07-14 00:06:07,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:06:07,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 00:06:07,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:07,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 00:06:07,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:06:07,265 INFO L87 Difference]: Start difference. First operand 7096 states and 9413 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 00:06:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:10,194 INFO L93 Difference]: Finished difference Result 16712 states and 22395 transitions. [2022-07-14 00:06:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 00:06:10,194 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 172 [2022-07-14 00:06:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:10,226 INFO L225 Difference]: With dead ends: 16712 [2022-07-14 00:06:10,226 INFO L226 Difference]: Without dead ends: 9632 [2022-07-14 00:06:10,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2022-07-14 00:06:10,249 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 669 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 5594 SdHoareTripleChecker+Invalid, 3739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:10,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 5594 Invalid, 3739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 00:06:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2022-07-14 00:06:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 8652. [2022-07-14 00:06:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8652 states, 6423 states have (on average 1.2665421142768176) internal successors, (8135), 6573 states have internal predecessors, (8135), 1497 states have call successors, (1497), 645 states have call predecessors, (1497), 731 states have return successors, (1863), 1473 states have call predecessors, (1863), 1496 states have call successors, (1863) [2022-07-14 00:06:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 11495 transitions. [2022-07-14 00:06:10,720 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 11495 transitions. Word has length 172 [2022-07-14 00:06:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:10,721 INFO L495 AbstractCegarLoop]: Abstraction has 8652 states and 11495 transitions. [2022-07-14 00:06:10,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 00:06:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 11495 transitions. [2022-07-14 00:06:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-14 00:06:10,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:10,740 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:10,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 00:06:10,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:10,954 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:10,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1960940060, now seen corresponding path program 1 times [2022-07-14 00:06:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:10,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099104056] [2022-07-14 00:06:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:06:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 00:06:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:06:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:06:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:06:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:06:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:06:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:06:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:06:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 00:06:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 00:06:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-14 00:06:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:11,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099104056] [2022-07-14 00:06:11,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099104056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:11,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244995552] [2022-07-14 00:06:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:11,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:11,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:06:11,236 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:06:11,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 00:06:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:11,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-14 00:06:11,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:06:11,971 INFO L356 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-07-14 00:06:11,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 18 treesize of output 36 [2022-07-14 00:06:12,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-14 00:06:12,274 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 00:06:12,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-07-14 00:06:12,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:06:12,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:06:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-14 00:06:12,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:06:12,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244995552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:12,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:06:12,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2022-07-14 00:06:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004552641] [2022-07-14 00:06:12,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:06:12,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 00:06:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 00:06:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2022-07-14 00:06:12,642 INFO L87 Difference]: Start difference. First operand 8652 states and 11495 transitions. Second operand has 22 states, 22 states have (on average 8.818181818181818) internal successors, (194), 15 states have internal predecessors, (194), 5 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 7 states have call predecessors, (36), 5 states have call successors, (36) [2022-07-14 00:06:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:17,793 INFO L93 Difference]: Finished difference Result 21557 states and 29035 transitions. [2022-07-14 00:06:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-14 00:06:17,793 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.818181818181818) internal successors, (194), 15 states have internal predecessors, (194), 5 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 7 states have call predecessors, (36), 5 states have call successors, (36) Word has length 178 [2022-07-14 00:06:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:17,840 INFO L225 Difference]: With dead ends: 21557 [2022-07-14 00:06:17,840 INFO L226 Difference]: Without dead ends: 13589 [2022-07-14 00:06:17,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=2906, Unknown=0, NotChecked=0, Total=3306 [2022-07-14 00:06:17,868 INFO L413 NwaCegarLoop]: 735 mSDtfsCounter, 2274 mSDsluCounter, 6475 mSDsCounter, 0 mSdLazyCounter, 6554 mSolverCounterSat, 1409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 7963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1409 IncrementalHoareTripleChecker+Valid, 6554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:17,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 7210 Invalid, 7963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1409 Valid, 6554 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-14 00:06:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13589 states. [2022-07-14 00:06:18,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13589 to 10664. [2022-07-14 00:06:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10664 states, 7962 states have (on average 1.277945239889475) internal successors, (10175), 8147 states have internal predecessors, (10175), 1808 states have call successors, (1808), 811 states have call predecessors, (1808), 893 states have return successors, (2200), 1745 states have call predecessors, (2200), 1807 states have call successors, (2200) [2022-07-14 00:06:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10664 states to 10664 states and 14183 transitions. [2022-07-14 00:06:18,475 INFO L78 Accepts]: Start accepts. Automaton has 10664 states and 14183 transitions. Word has length 178 [2022-07-14 00:06:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:18,475 INFO L495 AbstractCegarLoop]: Abstraction has 10664 states and 14183 transitions. [2022-07-14 00:06:18,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.818181818181818) internal successors, (194), 15 states have internal predecessors, (194), 5 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 7 states have call predecessors, (36), 5 states have call successors, (36) [2022-07-14 00:06:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 10664 states and 14183 transitions. [2022-07-14 00:06:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-14 00:06:18,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:18,499 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:18,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-14 00:06:18,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:18,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1411015937, now seen corresponding path program 1 times [2022-07-14 00:06:18,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:18,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094098155] [2022-07-14 00:06:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:06:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:06:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 00:06:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:06:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 00:06:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 00:06:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:06:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:18,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 00:06:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:19,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:06:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 00:06:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:19,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 00:06:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-14 00:06:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:19,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094098155] [2022-07-14 00:06:19,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094098155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:19,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733558761] [2022-07-14 00:06:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:19,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:06:19,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:06:19,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 00:06:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:19,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 2156 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 00:06:19,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:06:19,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:06:19,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:06:19,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:06:19,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:06:19,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:06:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-14 00:06:19,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:06:19,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1112 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_1112) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-07-14 00:06:19,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| Int)) (or (not (<= |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.base|)) (forall ((v_ArrVal_1112 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| v_ArrVal_1112) 26) 1))))) is different from false [2022-07-14 00:06:19,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| Int) (v_ArrVal_1112 (Array Int Int))) (or (< |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.base| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14|) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| v_ArrVal_1112) 26) 1)))) is different from false [2022-07-14 00:06:19,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| Int) (v_ArrVal_1112 (Array Int Int))) (or (< 0 |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14|) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| v_ArrVal_1112) 26) 1)))) is different from false [2022-07-14 00:06:19,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733558761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:19,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:06:19,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-14 00:06:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096418948] [2022-07-14 00:06:19,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:06:19,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 00:06:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:19,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 00:06:19,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=537, Unknown=4, NotChecked=196, Total=812 [2022-07-14 00:06:19,855 INFO L87 Difference]: Start difference. First operand 10664 states and 14183 transitions. Second operand has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-14 00:06:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:25,336 INFO L93 Difference]: Finished difference Result 21451 states and 29179 transitions. [2022-07-14 00:06:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 00:06:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) Word has length 180 [2022-07-14 00:06:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:25,390 INFO L225 Difference]: With dead ends: 21451 [2022-07-14 00:06:25,391 INFO L226 Difference]: Without dead ends: 14327 [2022-07-14 00:06:25,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=1105, Unknown=4, NotChecked=284, Total=1560 [2022-07-14 00:06:25,418 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 1677 mSDsluCounter, 11735 mSDsCounter, 0 mSdLazyCounter, 7775 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 12917 SdHoareTripleChecker+Invalid, 8654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 7775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:25,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 12917 Invalid, 8654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 7775 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-14 00:06:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14327 states. [2022-07-14 00:06:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14327 to 10672. [2022-07-14 00:06:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10672 states, 7970 states have (on average 1.2774153074027603) internal successors, (10181), 8151 states have internal predecessors, (10181), 1808 states have call successors, (1808), 811 states have call predecessors, (1808), 893 states have return successors, (2200), 1749 states have call predecessors, (2200), 1807 states have call successors, (2200) [2022-07-14 00:06:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10672 states to 10672 states and 14189 transitions. [2022-07-14 00:06:26,014 INFO L78 Accepts]: Start accepts. Automaton has 10672 states and 14189 transitions. Word has length 180 [2022-07-14 00:06:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:26,014 INFO L495 AbstractCegarLoop]: Abstraction has 10672 states and 14189 transitions. [2022-07-14 00:06:26,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-14 00:06:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 10672 states and 14189 transitions. [2022-07-14 00:06:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-14 00:06:26,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:26,036 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:26,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 00:06:26,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 00:06:26,252 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1457104041, now seen corresponding path program 2 times [2022-07-14 00:06:26,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:26,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136214826] [2022-07-14 00:06:26,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:06:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:06:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 00:06:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 00:06:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-14 00:06:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:06:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:06:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:06:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:06:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 00:06:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 00:06:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 00:06:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:26,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136214826] [2022-07-14 00:06:26,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136214826] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:26,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474270393] [2022-07-14 00:06:26,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:06:26,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:06:26,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:06:26,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 00:06:27,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:06:27,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:06:27,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 00:06:27,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:06:27,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-14 00:06:27,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-14 00:06:27,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:06:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-14 00:06:27,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:06:28,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_1316) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_1318) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_1320)) 26) 1))) is different from false [2022-07-14 00:06:29,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_1316) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_1318) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_1320)) 26) 1))) is different from false [2022-07-14 00:06:29,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_1316) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_1318) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_1320)) 26) 1))) is different from false [2022-07-14 00:06:30,569 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_1316) 930 v_ArrVal_1318) 0 v_ArrVal_1320)) 26) 1))) is different from false [2022-07-14 00:06:30,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474270393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:30,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:06:30,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-14 00:06:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313119679] [2022-07-14 00:06:30,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:06:30,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 00:06:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 00:06:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=685, Unknown=4, NotChecked=220, Total=992 [2022-07-14 00:06:30,574 INFO L87 Difference]: Start difference. First operand 10672 states and 14189 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 15 states have internal predecessors, (203), 4 states have call successors, (38), 9 states have call predecessors, (38), 6 states have return successors, (37), 6 states have call predecessors, (37), 4 states have call successors, (37) [2022-07-14 00:06:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:36,411 INFO L93 Difference]: Finished difference Result 21705 states and 29574 transitions. [2022-07-14 00:06:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 00:06:36,412 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 15 states have internal predecessors, (203), 4 states have call successors, (38), 9 states have call predecessors, (38), 6 states have return successors, (37), 6 states have call predecessors, (37), 4 states have call successors, (37) Word has length 186 [2022-07-14 00:06:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:36,454 INFO L225 Difference]: With dead ends: 21705 [2022-07-14 00:06:36,455 INFO L226 Difference]: Without dead ends: 14577 [2022-07-14 00:06:36,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=214, Invalid=1604, Unknown=4, NotChecked=340, Total=2162 [2022-07-14 00:06:36,473 INFO L413 NwaCegarLoop]: 1224 mSDtfsCounter, 1578 mSDsluCounter, 13554 mSDsCounter, 0 mSdLazyCounter, 8969 mSolverCounterSat, 662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 14778 SdHoareTripleChecker+Invalid, 9631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 8969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:36,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 14778 Invalid, 9631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 8969 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-14 00:06:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2022-07-14 00:06:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 11553. [2022-07-14 00:06:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11553 states, 8645 states have (on average 1.2766917293233082) internal successors, (11037), 8832 states have internal predecessors, (11037), 1938 states have call successors, (1938), 886 states have call predecessors, (1938), 969 states have return successors, (2344), 1874 states have call predecessors, (2344), 1937 states have call successors, (2344) [2022-07-14 00:06:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11553 states to 11553 states and 15319 transitions. [2022-07-14 00:06:37,155 INFO L78 Accepts]: Start accepts. Automaton has 11553 states and 15319 transitions. Word has length 186 [2022-07-14 00:06:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:37,156 INFO L495 AbstractCegarLoop]: Abstraction has 11553 states and 15319 transitions. [2022-07-14 00:06:37,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 15 states have internal predecessors, (203), 4 states have call successors, (38), 9 states have call predecessors, (38), 6 states have return successors, (37), 6 states have call predecessors, (37), 4 states have call successors, (37) [2022-07-14 00:06:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 11553 states and 15319 transitions. [2022-07-14 00:06:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-14 00:06:37,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:37,176 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:37,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 00:06:37,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 00:06:37,400 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1275845430, now seen corresponding path program 3 times [2022-07-14 00:06:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:37,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833175918] [2022-07-14 00:06:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:06:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:06:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:06:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 00:06:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:06:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:06:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:06:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:06:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:06:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 00:06:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-14 00:06:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-14 00:06:37,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:37,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833175918] [2022-07-14 00:06:37,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833175918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:06:37,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:06:37,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:06:37,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150286658] [2022-07-14 00:06:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:06:37,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:06:37,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:37,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:06:37,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:06:37,581 INFO L87 Difference]: Start difference. First operand 11553 states and 15319 transitions. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:06:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:39,306 INFO L93 Difference]: Finished difference Result 22019 states and 30032 transitions. [2022-07-14 00:06:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:06:39,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 194 [2022-07-14 00:06:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:39,345 INFO L225 Difference]: With dead ends: 22019 [2022-07-14 00:06:39,345 INFO L226 Difference]: Without dead ends: 14867 [2022-07-14 00:06:39,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:06:39,363 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 901 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:39,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2656 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 00:06:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14867 states. [2022-07-14 00:06:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14867 to 11537. [2022-07-14 00:06:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11537 states, 8637 states have (on average 1.2760217668171818) internal successors, (11021), 8824 states have internal predecessors, (11021), 1930 states have call successors, (1930), 886 states have call predecessors, (1930), 969 states have return successors, (2332), 1866 states have call predecessors, (2332), 1929 states have call successors, (2332) [2022-07-14 00:06:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 15283 transitions. [2022-07-14 00:06:39,971 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 15283 transitions. Word has length 194 [2022-07-14 00:06:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:39,972 INFO L495 AbstractCegarLoop]: Abstraction has 11537 states and 15283 transitions. [2022-07-14 00:06:39,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:06:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 15283 transitions. [2022-07-14 00:06:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-14 00:06:39,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:39,990 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:39,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 00:06:39,990 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:39,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash -276664566, now seen corresponding path program 1 times [2022-07-14 00:06:39,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:39,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400318012] [2022-07-14 00:06:39,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:06:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:06:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:06:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 00:06:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:06:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:06:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:06:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:06:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:06:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 00:06:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-14 00:06:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-14 00:06:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:40,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400318012] [2022-07-14 00:06:40,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400318012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:06:40,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:06:40,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 00:06:40,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767002455] [2022-07-14 00:06:40,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:06:40,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 00:06:40,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:40,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 00:06:40,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:06:40,295 INFO L87 Difference]: Start difference. First operand 11537 states and 15283 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-14 00:06:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:41,923 INFO L93 Difference]: Finished difference Result 19701 states and 26376 transitions. [2022-07-14 00:06:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:06:41,927 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 194 [2022-07-14 00:06:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:41,961 INFO L225 Difference]: With dead ends: 19701 [2022-07-14 00:06:41,961 INFO L226 Difference]: Without dead ends: 12565 [2022-07-14 00:06:41,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:06:41,978 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 858 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:41,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2369 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-14 00:06:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12565 states. [2022-07-14 00:06:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12565 to 11557. [2022-07-14 00:06:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11557 states, 8653 states have (on average 1.2755113833352594) internal successors, (11037), 8836 states have internal predecessors, (11037), 1934 states have call successors, (1934), 886 states have call predecessors, (1934), 969 states have return successors, (2336), 1874 states have call predecessors, (2336), 1933 states have call successors, (2336) [2022-07-14 00:06:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11557 states to 11557 states and 15307 transitions. [2022-07-14 00:06:42,597 INFO L78 Accepts]: Start accepts. Automaton has 11557 states and 15307 transitions. Word has length 194 [2022-07-14 00:06:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:42,597 INFO L495 AbstractCegarLoop]: Abstraction has 11557 states and 15307 transitions. [2022-07-14 00:06:42,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-14 00:06:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 11557 states and 15307 transitions. [2022-07-14 00:06:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-14 00:06:42,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:42,613 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:42,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 00:06:42,614 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash 454006962, now seen corresponding path program 2 times [2022-07-14 00:06:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:42,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860574803] [2022-07-14 00:06:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:06:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:06:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:06:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:06:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:06:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 00:06:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:06:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:06:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:06:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:06:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:06:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-14 00:06:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-14 00:06:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 00:06:42,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:42,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860574803] [2022-07-14 00:06:42,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860574803] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:42,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615790063] [2022-07-14 00:06:42,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:06:42,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:42,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:06:42,839 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:06:42,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 00:06:43,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:06:43,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:06:43,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 2251 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 00:06:43,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:06:43,490 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-14 00:06:43,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 18 treesize of output 45 [2022-07-14 00:06:43,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-14 00:06:43,608 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-14 00:06:43,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-07-14 00:06:43,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-14 00:06:43,719 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 00:06:43,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-07-14 00:06:43,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:06:43,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:06:43,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:06:43,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:06:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-14 00:06:43,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:06:44,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_1786) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-07-14 00:06:44,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_1786) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-07-14 00:06:44,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615790063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:44,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:06:44,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2022-07-14 00:06:44,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787842033] [2022-07-14 00:06:44,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:06:44,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 00:06:44,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:44,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 00:06:44,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1086, Unknown=9, NotChecked=134, Total=1332 [2022-07-14 00:06:44,145 INFO L87 Difference]: Start difference. First operand 11557 states and 15307 transitions. Second operand has 28 states, 28 states have (on average 7.75) internal successors, (217), 21 states have internal predecessors, (217), 6 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2022-07-14 00:06:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:51,078 INFO L93 Difference]: Finished difference Result 22741 states and 30552 transitions. [2022-07-14 00:06:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-14 00:06:51,078 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 21 states have internal predecessors, (217), 6 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) Word has length 200 [2022-07-14 00:06:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:51,107 INFO L225 Difference]: With dead ends: 22741 [2022-07-14 00:06:51,108 INFO L226 Difference]: Without dead ends: 15561 [2022-07-14 00:06:51,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=404, Invalid=3500, Unknown=10, NotChecked=246, Total=4160 [2022-07-14 00:06:51,119 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 2382 mSDsluCounter, 13930 mSDsCounter, 0 mSdLazyCounter, 10042 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 14924 SdHoareTripleChecker+Invalid, 12079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 10042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 850 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:51,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 14924 Invalid, 12079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 10042 Invalid, 0 Unknown, 850 Unchecked, 5.4s Time] [2022-07-14 00:06:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2022-07-14 00:06:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 13109. [2022-07-14 00:06:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13109 states, 9840 states have (on average 1.2760162601626017) internal successors, (12556), 10027 states have internal predecessors, (12556), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1100 states have return successors, (2588), 2092 states have call predecessors, (2588), 2167 states have call successors, (2588) [2022-07-14 00:06:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 17312 transitions. [2022-07-14 00:06:51,866 INFO L78 Accepts]: Start accepts. Automaton has 13109 states and 17312 transitions. Word has length 200 [2022-07-14 00:06:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:51,867 INFO L495 AbstractCegarLoop]: Abstraction has 13109 states and 17312 transitions. [2022-07-14 00:06:51,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 21 states have internal predecessors, (217), 6 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2022-07-14 00:06:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 13109 states and 17312 transitions. [2022-07-14 00:06:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-14 00:06:51,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:51,887 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:51,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 00:06:52,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:52,104 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1863810439, now seen corresponding path program 1 times [2022-07-14 00:06:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:52,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841266637] [2022-07-14 00:06:52,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:06:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:06:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:06:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:06:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:06:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 00:06:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:06:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:06:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:06:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:06:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 00:06:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:06:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-14 00:06:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-14 00:06:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 00:06:52,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:52,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841266637] [2022-07-14 00:06:52,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841266637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:06:52,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:06:52,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 00:06:52,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011661780] [2022-07-14 00:06:52,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:06:52,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 00:06:52,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:52,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 00:06:52,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:06:52,407 INFO L87 Difference]: Start difference. First operand 13109 states and 17312 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-14 00:06:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:54,700 INFO L93 Difference]: Finished difference Result 23691 states and 32221 transitions. [2022-07-14 00:06:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 00:06:54,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 211 [2022-07-14 00:06:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:54,753 INFO L225 Difference]: With dead ends: 23691 [2022-07-14 00:06:54,753 INFO L226 Difference]: Without dead ends: 16503 [2022-07-14 00:06:54,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:06:54,775 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 917 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 4355 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:54,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 4355 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 00:06:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16503 states. [2022-07-14 00:06:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16503 to 13137. [2022-07-14 00:06:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13137 states, 9860 states have (on average 1.2766734279918863) internal successors, (12588), 10055 states have internal predecessors, (12588), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1108 states have return successors, (2620), 2092 states have call predecessors, (2620), 2167 states have call successors, (2620) [2022-07-14 00:06:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13137 states to 13137 states and 17376 transitions. [2022-07-14 00:06:55,592 INFO L78 Accepts]: Start accepts. Automaton has 13137 states and 17376 transitions. Word has length 211 [2022-07-14 00:06:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:55,593 INFO L495 AbstractCegarLoop]: Abstraction has 13137 states and 17376 transitions. [2022-07-14 00:06:55,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-14 00:06:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13137 states and 17376 transitions. [2022-07-14 00:06:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-14 00:06:55,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:55,612 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:55,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 00:06:55,612 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1503128751, now seen corresponding path program 1 times [2022-07-14 00:06:55,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:55,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437080401] [2022-07-14 00:06:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:06:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:06:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:06:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:06:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:06:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 00:06:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:06:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:06:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:06:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:06:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:06:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:06:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-14 00:06:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:06:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 00:06:55,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:55,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437080401] [2022-07-14 00:06:55,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437080401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:55,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170066976] [2022-07-14 00:06:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:55,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:06:55,988 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:06:56,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 00:06:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:56,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 00:06:56,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:06:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-14 00:06:56,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:06:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 00:06:56,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170066976] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:56,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:06:56,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 5] total 12 [2022-07-14 00:06:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147950665] [2022-07-14 00:06:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:06:56,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:06:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:06:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:06:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:06:56,748 INFO L87 Difference]: Start difference. First operand 13137 states and 17376 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:06:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:06:57,540 INFO L93 Difference]: Finished difference Result 20397 states and 27455 transitions. [2022-07-14 00:06:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:06:57,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 212 [2022-07-14 00:06:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:06:57,573 INFO L225 Difference]: With dead ends: 20397 [2022-07-14 00:06:57,573 INFO L226 Difference]: Without dead ends: 13181 [2022-07-14 00:06:57,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 461 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:06:57,589 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 3 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:06:57,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1962 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 00:06:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13181 states. [2022-07-14 00:06:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13181 to 13157. [2022-07-14 00:06:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13157 states, 9880 states have (on average 1.2765182186234818) internal successors, (12612), 10075 states have internal predecessors, (12612), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1108 states have return successors, (2620), 2092 states have call predecessors, (2620), 2167 states have call successors, (2620) [2022-07-14 00:06:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 17400 transitions. [2022-07-14 00:06:58,281 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 17400 transitions. Word has length 212 [2022-07-14 00:06:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:06:58,282 INFO L495 AbstractCegarLoop]: Abstraction has 13157 states and 17400 transitions. [2022-07-14 00:06:58,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:06:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 17400 transitions. [2022-07-14 00:06:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-14 00:06:58,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:06:58,305 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:06:58,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 00:06:58,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:58,526 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:06:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:06:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -361861751, now seen corresponding path program 1 times [2022-07-14 00:06:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:06:58,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401018967] [2022-07-14 00:06:58,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:06:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:06:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:06:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:06:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:06:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:06:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:06:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:06:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 00:06:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:06:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:06:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:06:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:06:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 00:06:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:06:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:06:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:06:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-14 00:06:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 00:06:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-14 00:06:58,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:06:58,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401018967] [2022-07-14 00:06:58,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401018967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:06:58,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042158616] [2022-07-14 00:06:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:06:58,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:06:58,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:06:58,960 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:06:59,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 00:06:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:06:59,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 2442 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-14 00:06:59,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:06:59,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-14 00:06:59,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:06:59,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:06:59,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-14 00:06:59,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-14 00:07:00,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:07:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 91 proven. 19 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-14 00:07:00,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:07:00,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_2721) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_2720) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_2722)) 26) 1))) is different from false [2022-07-14 00:07:01,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_2721) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_2720) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_2722)) 26) 1))) is different from false [2022-07-14 00:07:02,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_2721) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_2720) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_2722)) 26) 1))) is different from false [2022-07-14 00:07:03,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_2721) 930 v_ArrVal_2720) 0 v_ArrVal_2722)) 26) 1))) is different from false [2022-07-14 00:07:03,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042158616] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:03,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:07:03,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2022-07-14 00:07:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768317209] [2022-07-14 00:07:03,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:07:03,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 00:07:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:07:03,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 00:07:03,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=790, Unknown=4, NotChecked=236, Total=1122 [2022-07-14 00:07:03,214 INFO L87 Difference]: Start difference. First operand 13157 states and 17400 transitions. Second operand has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-07-14 00:07:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:07:10,379 INFO L93 Difference]: Finished difference Result 27093 states and 36763 transitions. [2022-07-14 00:07:10,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-14 00:07:10,380 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) Word has length 213 [2022-07-14 00:07:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:07:10,421 INFO L225 Difference]: With dead ends: 27093 [2022-07-14 00:07:10,421 INFO L226 Difference]: Without dead ends: 19847 [2022-07-14 00:07:10,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=488, Invalid=3814, Unknown=4, NotChecked=524, Total=4830 [2022-07-14 00:07:10,439 INFO L413 NwaCegarLoop]: 1249 mSDtfsCounter, 2123 mSDsluCounter, 12718 mSDsCounter, 0 mSdLazyCounter, 8862 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 13967 SdHoareTripleChecker+Invalid, 10716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1144 IncrementalHoareTripleChecker+Valid, 8862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:07:10,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 13967 Invalid, 10716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1144 Valid, 8862 Invalid, 0 Unknown, 710 Unchecked, 5.2s Time] [2022-07-14 00:07:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19847 states. [2022-07-14 00:07:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19847 to 13173. [2022-07-14 00:07:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13173 states, 9896 states have (on average 1.276879547291835) internal successors, (12636), 10091 states have internal predecessors, (12636), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1108 states have return successors, (2620), 2092 states have call predecessors, (2620), 2167 states have call successors, (2620) [2022-07-14 00:07:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13173 states to 13173 states and 17424 transitions. [2022-07-14 00:07:11,279 INFO L78 Accepts]: Start accepts. Automaton has 13173 states and 17424 transitions. Word has length 213 [2022-07-14 00:07:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:07:11,280 INFO L495 AbstractCegarLoop]: Abstraction has 13173 states and 17424 transitions. [2022-07-14 00:07:11,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-07-14 00:07:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 13173 states and 17424 transitions. [2022-07-14 00:07:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-14 00:07:11,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:07:11,296 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:07:11,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 00:07:11,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:07:11,499 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:07:11,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:07:11,499 INFO L85 PathProgramCache]: Analyzing trace with hash -158585203, now seen corresponding path program 2 times [2022-07-14 00:07:11,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:07:11,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889458151] [2022-07-14 00:07:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:07:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:07:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:07:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:07:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:07:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:07:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:07:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:07:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:07:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 00:07:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:07:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:07:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:07:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:07:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:07:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:07:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:07:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 00:07:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 00:07:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-14 00:07:11,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:07:11,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889458151] [2022-07-14 00:07:11,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889458151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:11,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33283172] [2022-07-14 00:07:11,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:07:11,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:07:11,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:07:11,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:07:11,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 00:07:12,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:07:12,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:07:12,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 2563 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-14 00:07:12,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:07:12,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-14 00:07:12,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:07:12,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:12,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-14 00:07:12,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-14 00:07:12,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:07:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-14 00:07:12,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:07:13,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_3299) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_3301) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_3304)) 26) 1))) is different from false [2022-07-14 00:07:14,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_3299) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_3301) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_3304)) 26) 1))) is different from false [2022-07-14 00:07:15,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_3299) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_3301) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_3304)) 26) 1))) is different from false [2022-07-14 00:07:15,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_3299) 930 v_ArrVal_3301) 0 v_ArrVal_3304)) 26) 1))) is different from false [2022-07-14 00:07:15,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33283172] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:15,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:07:15,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2022-07-14 00:07:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331261121] [2022-07-14 00:07:15,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:07:15,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 00:07:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:07:15,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 00:07:15,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=907, Unknown=4, NotChecked=252, Total=1260 [2022-07-14 00:07:15,878 INFO L87 Difference]: Start difference. First operand 13173 states and 17424 transitions. Second operand has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-07-14 00:07:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:07:25,356 INFO L93 Difference]: Finished difference Result 30123 states and 40915 transitions. [2022-07-14 00:07:25,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-14 00:07:25,358 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) Word has length 214 [2022-07-14 00:07:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:07:25,417 INFO L225 Difference]: With dead ends: 30123 [2022-07-14 00:07:25,417 INFO L226 Difference]: Without dead ends: 22861 [2022-07-14 00:07:25,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=530, Invalid=4174, Unknown=4, NotChecked=548, Total=5256 [2022-07-14 00:07:25,442 INFO L413 NwaCegarLoop]: 1454 mSDtfsCounter, 2058 mSDsluCounter, 17598 mSDsCounter, 0 mSdLazyCounter, 12134 mSolverCounterSat, 1078 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 19052 SdHoareTripleChecker+Invalid, 14303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 12134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1091 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:07:25,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2155 Valid, 19052 Invalid, 14303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1078 Valid, 12134 Invalid, 0 Unknown, 1091 Unchecked, 7.3s Time] [2022-07-14 00:07:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22861 states. [2022-07-14 00:07:26,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22861 to 13187. [2022-07-14 00:07:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13187 states, 9908 states have (on average 1.2774525635849818) internal successors, (12657), 10103 states have internal predecessors, (12657), 2169 states have call successors, (2169), 1030 states have call predecessors, (2169), 1109 states have return successors, (2622), 2093 states have call predecessors, (2622), 2168 states have call successors, (2622) [2022-07-14 00:07:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13187 states to 13187 states and 17448 transitions. [2022-07-14 00:07:26,301 INFO L78 Accepts]: Start accepts. Automaton has 13187 states and 17448 transitions. Word has length 214 [2022-07-14 00:07:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:07:26,301 INFO L495 AbstractCegarLoop]: Abstraction has 13187 states and 17448 transitions. [2022-07-14 00:07:26,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-07-14 00:07:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 13187 states and 17448 transitions. [2022-07-14 00:07:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-14 00:07:26,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:07:26,318 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:07:26,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 00:07:26,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 00:07:26,521 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:07:26,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:07:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash -266252569, now seen corresponding path program 1 times [2022-07-14 00:07:26,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:07:26,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694482462] [2022-07-14 00:07:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:07:26,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:07:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:07:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:07:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:07:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:07:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:07:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:07:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:07:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 00:07:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 00:07:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-14 00:07:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 00:07:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:07:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:07:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:07:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-14 00:07:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:07:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-14 00:07:26,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:07:26,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694482462] [2022-07-14 00:07:26,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694482462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:26,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877092726] [2022-07-14 00:07:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:07:26,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:07:26,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:07:26,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:07:26,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 00:07:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:27,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 2676 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-14 00:07:27,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:07:27,817 INFO L356 Elim1Store]: treesize reduction 79, result has 32.5 percent of original size [2022-07-14 00:07:27,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 49 [2022-07-14 00:07:27,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-14 00:07:27,960 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-14 00:07:27,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-07-14 00:07:28,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-14 00:07:28,065 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 00:07:28,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-07-14 00:07:28,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:28,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:28,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:28,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:28,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:07:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 67 proven. 16 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-14 00:07:28,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:07:28,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4064) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)) 0))) is different from false [2022-07-14 00:07:28,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4064) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)) 0))) is different from false [2022-07-14 00:07:28,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4064) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 3 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)) 0))) is different from false [2022-07-14 00:07:28,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877092726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:28,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:07:28,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 30 [2022-07-14 00:07:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378390071] [2022-07-14 00:07:28,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:07:28,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 00:07:28,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:07:28,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 00:07:28,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1229, Unknown=5, NotChecked=216, Total=1560 [2022-07-14 00:07:28,561 INFO L87 Difference]: Start difference. First operand 13187 states and 17448 transitions. Second operand has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 24 states have internal predecessors, (227), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-07-14 00:07:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:07:37,156 INFO L93 Difference]: Finished difference Result 25121 states and 34447 transitions. [2022-07-14 00:07:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 00:07:37,157 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 24 states have internal predecessors, (227), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) Word has length 212 [2022-07-14 00:07:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:07:37,207 INFO L225 Difference]: With dead ends: 25121 [2022-07-14 00:07:37,207 INFO L226 Difference]: Without dead ends: 17861 [2022-07-14 00:07:37,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=3222, Unknown=5, NotChecked=354, Total=3906 [2022-07-14 00:07:37,226 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 1474 mSDsluCounter, 15962 mSDsCounter, 0 mSdLazyCounter, 10110 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 17131 SdHoareTripleChecker+Invalid, 11446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 10110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:07:37,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 17131 Invalid, 11446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 10110 Invalid, 0 Unknown, 689 Unchecked, 6.8s Time] [2022-07-14 00:07:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17861 states. [2022-07-14 00:07:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17861 to 13433. [2022-07-14 00:07:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13433 states, 10140 states have (on average 1.2837278106508876) internal successors, (13017), 10334 states have internal predecessors, (13017), 2176 states have call successors, (2176), 1037 states have call predecessors, (2176), 1116 states have return successors, (2632), 2101 states have call predecessors, (2632), 2175 states have call successors, (2632) [2022-07-14 00:07:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13433 states to 13433 states and 17825 transitions. [2022-07-14 00:07:38,058 INFO L78 Accepts]: Start accepts. Automaton has 13433 states and 17825 transitions. Word has length 212 [2022-07-14 00:07:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:07:38,058 INFO L495 AbstractCegarLoop]: Abstraction has 13433 states and 17825 transitions. [2022-07-14 00:07:38,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 24 states have internal predecessors, (227), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-07-14 00:07:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 13433 states and 17825 transitions. [2022-07-14 00:07:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-14 00:07:38,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:07:38,074 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:07:38,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 00:07:38,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-14 00:07:38,279 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:07:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:07:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 582910906, now seen corresponding path program 2 times [2022-07-14 00:07:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:07:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132926494] [2022-07-14 00:07:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:07:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:07:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:07:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:07:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:07:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:07:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:07:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 00:07:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:07:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:07:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 00:07:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 00:07:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:07:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 00:07:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:07:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:07:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-14 00:07:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 00:07:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-14 00:07:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:07:38,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132926494] [2022-07-14 00:07:38,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132926494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:38,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230684816] [2022-07-14 00:07:38,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:07:38,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:07:38,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:07:38,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:07:38,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 00:07:39,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:07:39,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:07:39,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-14 00:07:39,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:07:39,563 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-14 00:07:39,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 18 treesize of output 45 [2022-07-14 00:07:39,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-14 00:07:39,686 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-14 00:07:39,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-07-14 00:07:39,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-14 00:07:39,785 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 00:07:39,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-07-14 00:07:39,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:39,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:07:39,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:39,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:07:39,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:39,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:07:39,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:40,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:40,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:07:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 67 proven. 24 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-14 00:07:40,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:07:40,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-07-14 00:07:40,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-07-14 00:07:40,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 3 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-07-14 00:07:40,232 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 4 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-07-14 00:07:40,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230684816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:40,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:07:40,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 32 [2022-07-14 00:07:40,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881111144] [2022-07-14 00:07:40,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:07:40,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 00:07:40,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:07:40,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 00:07:40,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1358, Unknown=11, NotChecked=308, Total=1806 [2022-07-14 00:07:40,390 INFO L87 Difference]: Start difference. First operand 13433 states and 17825 transitions. Second operand has 32 states, 32 states have (on average 7.1875) internal successors, (230), 26 states have internal predecessors, (230), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-07-14 00:07:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:07:48,395 INFO L93 Difference]: Finished difference Result 26943 states and 37126 transitions. [2022-07-14 00:07:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-14 00:07:48,395 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.1875) internal successors, (230), 26 states have internal predecessors, (230), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) Word has length 215 [2022-07-14 00:07:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:07:48,434 INFO L225 Difference]: With dead ends: 26943 [2022-07-14 00:07:48,435 INFO L226 Difference]: Without dead ends: 19675 [2022-07-14 00:07:48,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=510, Invalid=4896, Unknown=12, NotChecked=588, Total=6006 [2022-07-14 00:07:48,449 INFO L413 NwaCegarLoop]: 1014 mSDtfsCounter, 3100 mSDsluCounter, 11252 mSDsCounter, 0 mSdLazyCounter, 8649 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3202 SdHoareTripleChecker+Valid, 12266 SdHoareTripleChecker+Invalid, 10848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 8649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:07:48,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3202 Valid, 12266 Invalid, 10848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 8649 Invalid, 0 Unknown, 528 Unchecked, 5.7s Time] [2022-07-14 00:07:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19675 states. [2022-07-14 00:07:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19675 to 13461. [2022-07-14 00:07:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13461 states, 10168 states have (on average 1.2839299763965382) internal successors, (13055), 10362 states have internal predecessors, (13055), 2176 states have call successors, (2176), 1037 states have call predecessors, (2176), 1116 states have return successors, (2632), 2101 states have call predecessors, (2632), 2175 states have call successors, (2632) [2022-07-14 00:07:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 17863 transitions. [2022-07-14 00:07:49,307 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 17863 transitions. Word has length 215 [2022-07-14 00:07:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:07:49,307 INFO L495 AbstractCegarLoop]: Abstraction has 13461 states and 17863 transitions. [2022-07-14 00:07:49,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.1875) internal successors, (230), 26 states have internal predecessors, (230), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-07-14 00:07:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 17863 transitions. [2022-07-14 00:07:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-14 00:07:49,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:07:49,325 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:07:49,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 00:07:49,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-14 00:07:49,532 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:07:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:07:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash 565303061, now seen corresponding path program 3 times [2022-07-14 00:07:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:07:49,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935265282] [2022-07-14 00:07:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:07:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:07:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:07:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:07:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:07:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:07:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:07:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 00:07:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:07:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:07:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 00:07:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:07:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:07:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:07:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:49,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:07:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:50,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-14 00:07:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:50,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:07:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:50,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:07:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 00:07:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-14 00:07:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-14 00:07:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:07:50,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935265282] [2022-07-14 00:07:50,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935265282] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:50,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348871778] [2022-07-14 00:07:50,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 00:07:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:07:50,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:07:50,032 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:07:50,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 00:07:50,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-14 00:07:50,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:07:50,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 00:07:50,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:07:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2022-07-14 00:07:50,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:07:50,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348871778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:07:50,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:07:50,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2022-07-14 00:07:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715995782] [2022-07-14 00:07:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:07:50,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:07:50,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:07:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:07:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-07-14 00:07:50,767 INFO L87 Difference]: Start difference. First operand 13461 states and 17863 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:07:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:07:52,779 INFO L93 Difference]: Finished difference Result 26117 states and 35120 transitions. [2022-07-14 00:07:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:07:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 224 [2022-07-14 00:07:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:07:52,815 INFO L225 Difference]: With dead ends: 26117 [2022-07-14 00:07:52,815 INFO L226 Difference]: Without dead ends: 18831 [2022-07-14 00:07:52,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-07-14 00:07:52,826 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 1049 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 4211 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:07:52,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 4211 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 00:07:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18831 states. [2022-07-14 00:07:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18831 to 16595. [2022-07-14 00:07:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16595 states, 12528 states have (on average 1.2802522349936143) internal successors, (16039), 12752 states have internal predecessors, (16039), 2698 states have call successors, (2698), 1281 states have call predecessors, (2698), 1368 states have return successors, (3180), 2617 states have call predecessors, (3180), 2697 states have call successors, (3180) [2022-07-14 00:07:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16595 states to 16595 states and 21917 transitions. [2022-07-14 00:07:53,969 INFO L78 Accepts]: Start accepts. Automaton has 16595 states and 21917 transitions. Word has length 224 [2022-07-14 00:07:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:07:53,969 INFO L495 AbstractCegarLoop]: Abstraction has 16595 states and 21917 transitions. [2022-07-14 00:07:53,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:07:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 16595 states and 21917 transitions. [2022-07-14 00:07:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-14 00:07:53,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:07:53,988 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:07:54,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 00:07:54,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-14 00:07:54,191 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:07:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:07:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash -935054258, now seen corresponding path program 1 times [2022-07-14 00:07:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:07:54,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972516201] [2022-07-14 00:07:54,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:07:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:07:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:07:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:07:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:07:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:07:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:07:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 00:07:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:07:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:07:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 00:07:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:07:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:07:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:07:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:07:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-14 00:07:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:07:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:07:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:07:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-14 00:07:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:07:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:07:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-14 00:07:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:07:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:07:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-07-14 00:07:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:07:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972516201] [2022-07-14 00:07:54,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972516201] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:54,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929151378] [2022-07-14 00:07:54,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:07:54,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:07:54,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:07:54,786 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:07:54,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 00:07:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:07:55,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 3088 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-14 00:07:55,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:07:55,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-14 00:07:55,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-14 00:07:55,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:07:55,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:55,675 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:07:55,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 00:07:55,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-14 00:07:55,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:07:55,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:07:55,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-14 00:07:55,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-14 00:07:56,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:07:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 119 proven. 12 refuted. 5 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-14 00:07:56,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:07:57,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7142 Int) (v_ArrVal_7145 Int) (v_ArrVal_7144 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_7144) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_7142) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_7145)) 26) 1))) is different from false [2022-07-14 00:07:57,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7142 Int) (v_ArrVal_7145 Int) (v_ArrVal_7144 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_7144) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_7142) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_7145)) 26) 1))) is different from false [2022-07-14 00:07:58,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7142 Int) (v_ArrVal_7145 Int) (v_ArrVal_7144 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_7144) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_7142) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_7145)) 26) 1))) is different from false [2022-07-14 00:07:59,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_7142 Int) (v_ArrVal_7145 Int) (v_ArrVal_7144 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_7144) 930 v_ArrVal_7142) 0 v_ArrVal_7145)) 26) 1))) is different from false [2022-07-14 00:07:59,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929151378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:07:59,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:07:59,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2022-07-14 00:07:59,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17512411] [2022-07-14 00:07:59,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:07:59,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 00:07:59,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:07:59,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 00:07:59,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1099, Unknown=5, NotChecked=276, Total=1482 [2022-07-14 00:07:59,385 INFO L87 Difference]: Start difference. First operand 16595 states and 21917 transitions. Second operand has 31 states, 31 states have (on average 8.129032258064516) internal successors, (252), 24 states have internal predecessors, (252), 8 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2022-07-14 00:08:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:08:11,606 INFO L93 Difference]: Finished difference Result 39231 states and 53618 transitions. [2022-07-14 00:08:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-14 00:08:11,607 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.129032258064516) internal successors, (252), 24 states have internal predecessors, (252), 8 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) Word has length 251 [2022-07-14 00:08:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:08:11,677 INFO L225 Difference]: With dead ends: 39231 [2022-07-14 00:08:11,678 INFO L226 Difference]: Without dead ends: 28811 [2022-07-14 00:08:11,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=592, Invalid=5581, Unknown=5, NotChecked=628, Total=6806 [2022-07-14 00:08:11,702 INFO L413 NwaCegarLoop]: 1251 mSDtfsCounter, 2456 mSDsluCounter, 17608 mSDsCounter, 0 mSdLazyCounter, 12782 mSolverCounterSat, 1424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 18859 SdHoareTripleChecker+Invalid, 15032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1424 IncrementalHoareTripleChecker+Valid, 12782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 826 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:08:11,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2572 Valid, 18859 Invalid, 15032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1424 Valid, 12782 Invalid, 0 Unknown, 826 Unchecked, 9.0s Time] [2022-07-14 00:08:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28811 states. [2022-07-14 00:08:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28811 to 17851. [2022-07-14 00:08:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17851 states, 13486 states have (on average 1.2846655791190864) internal successors, (17325), 13715 states have internal predecessors, (17325), 2896 states have call successors, (2896), 1391 states have call predecessors, (2896), 1468 states have return successors, (3244), 2800 states have call predecessors, (3244), 2895 states have call successors, (3244) [2022-07-14 00:08:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17851 states to 17851 states and 23465 transitions. [2022-07-14 00:08:13,122 INFO L78 Accepts]: Start accepts. Automaton has 17851 states and 23465 transitions. Word has length 251 [2022-07-14 00:08:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:08:13,122 INFO L495 AbstractCegarLoop]: Abstraction has 17851 states and 23465 transitions. [2022-07-14 00:08:13,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.129032258064516) internal successors, (252), 24 states have internal predecessors, (252), 8 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2022-07-14 00:08:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 17851 states and 23465 transitions. [2022-07-14 00:08:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-14 00:08:13,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:08:13,143 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:08:13,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 00:08:13,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:08:13,343 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:08:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:08:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash -853514858, now seen corresponding path program 2 times [2022-07-14 00:08:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:08:13,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786806922] [2022-07-14 00:08:13,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:08:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:08:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:08:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:08:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:08:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 00:08:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:08:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:08:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 00:08:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:08:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:08:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:08:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:08:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 00:08:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:08:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 00:08:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:08:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-14 00:08:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-14 00:08:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 00:08:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2022-07-14 00:08:13,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:08:13,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786806922] [2022-07-14 00:08:13,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786806922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:08:13,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014562411] [2022-07-14 00:08:13,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:08:13,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:08:13,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:08:13,965 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:08:13,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 00:08:14,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 00:08:14,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:08:14,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 00:08:14,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:08:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-07-14 00:08:14,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:08:14,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014562411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:08:14,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:08:14,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 24 [2022-07-14 00:08:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373578724] [2022-07-14 00:08:14,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:08:14,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:08:14,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:08:14,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:08:14,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2022-07-14 00:08:14,842 INFO L87 Difference]: Start difference. First operand 17851 states and 23465 transitions. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:08:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:08:19,085 INFO L93 Difference]: Finished difference Result 36056 states and 47605 transitions. [2022-07-14 00:08:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 00:08:19,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 252 [2022-07-14 00:08:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:08:19,145 INFO L225 Difference]: With dead ends: 36056 [2022-07-14 00:08:19,146 INFO L226 Difference]: Without dead ends: 25709 [2022-07-14 00:08:19,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2022-07-14 00:08:19,170 INFO L413 NwaCegarLoop]: 871 mSDtfsCounter, 2305 mSDsluCounter, 3224 mSDsCounter, 0 mSdLazyCounter, 3012 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2408 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 3012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:08:19,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2408 Valid, 4095 Invalid, 3609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 3012 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-14 00:08:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25709 states. [2022-07-14 00:08:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25709 to 21155. [2022-07-14 00:08:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21155 states, 15964 states have (on average 1.2816963167126034) internal successors, (20461), 16231 states have internal predecessors, (20461), 3464 states have call successors, (3464), 1641 states have call predecessors, (3464), 1726 states have return successors, (3852), 3354 states have call predecessors, (3852), 3463 states have call successors, (3852) [2022-07-14 00:08:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 27777 transitions. [2022-07-14 00:08:20,820 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 27777 transitions. Word has length 252 [2022-07-14 00:08:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:08:20,820 INFO L495 AbstractCegarLoop]: Abstraction has 21155 states and 27777 transitions. [2022-07-14 00:08:20,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:08:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 27777 transitions. [2022-07-14 00:08:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-14 00:08:20,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:08:20,846 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:08:20,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-14 00:08:21,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-14 00:08:21,060 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:08:21,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:08:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2103994783, now seen corresponding path program 1 times [2022-07-14 00:08:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:08:21,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966749871] [2022-07-14 00:08:21,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:08:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:08:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:08:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:08:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:08:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 00:08:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:08:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:08:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 00:08:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:08:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:08:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:08:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:08:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 00:08:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:08:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 00:08:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:08:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-14 00:08:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-14 00:08:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-14 00:08:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-14 00:08:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-07-14 00:08:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:08:21,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966749871] [2022-07-14 00:08:21,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966749871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:08:21,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:08:21,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:08:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976747027] [2022-07-14 00:08:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:08:21,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:08:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:08:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:08:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:08:21,367 INFO L87 Difference]: Start difference. First operand 21155 states and 27777 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 00:08:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:08:24,674 INFO L93 Difference]: Finished difference Result 40881 states and 54995 transitions. [2022-07-14 00:08:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:08:24,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 268 [2022-07-14 00:08:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:08:24,737 INFO L225 Difference]: With dead ends: 40881 [2022-07-14 00:08:24,737 INFO L226 Difference]: Without dead ends: 27235 [2022-07-14 00:08:24,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:08:24,762 INFO L413 NwaCegarLoop]: 903 mSDtfsCounter, 1632 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:08:24,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 2917 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-14 00:08:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27235 states. [2022-07-14 00:08:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27235 to 21155. [2022-07-14 00:08:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21155 states, 15964 states have (on average 1.2814457529441243) internal successors, (20457), 16231 states have internal predecessors, (20457), 3464 states have call successors, (3464), 1641 states have call predecessors, (3464), 1726 states have return successors, (3852), 3354 states have call predecessors, (3852), 3463 states have call successors, (3852) [2022-07-14 00:08:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 27773 transitions. [2022-07-14 00:08:26,662 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 27773 transitions. Word has length 268 [2022-07-14 00:08:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:08:26,662 INFO L495 AbstractCegarLoop]: Abstraction has 21155 states and 27773 transitions. [2022-07-14 00:08:26,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 00:08:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 27773 transitions. [2022-07-14 00:08:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-14 00:08:26,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:08:26,686 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:08:26,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 00:08:26,686 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:08:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:08:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash 649205509, now seen corresponding path program 1 times [2022-07-14 00:08:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:08:26,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4131757] [2022-07-14 00:08:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:08:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:08:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:08:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:08:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:08:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 00:08:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:08:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:08:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 00:08:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:08:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:08:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:08:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:08:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 00:08:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:08:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 00:08:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:08:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-14 00:08:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:27,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-14 00:08:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-14 00:08:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-14 00:08:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-07-14 00:08:27,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:08:27,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4131757] [2022-07-14 00:08:27,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4131757] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:08:27,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170535343] [2022-07-14 00:08:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:08:27,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:08:27,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:08:27,031 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:08:27,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-14 00:08:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:28,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 3443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 00:08:28,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:08:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-07-14 00:08:28,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:08:28,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170535343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:08:28,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:08:28,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2022-07-14 00:08:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677265685] [2022-07-14 00:08:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:08:28,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:08:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:08:28,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:08:28,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:08:28,233 INFO L87 Difference]: Start difference. First operand 21155 states and 27773 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 00:08:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:08:32,725 INFO L93 Difference]: Finished difference Result 63383 states and 83214 transitions. [2022-07-14 00:08:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:08:32,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 271 [2022-07-14 00:08:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:08:32,893 INFO L225 Difference]: With dead ends: 63383 [2022-07-14 00:08:32,893 INFO L226 Difference]: Without dead ends: 63375 [2022-07-14 00:08:32,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:08:32,923 INFO L413 NwaCegarLoop]: 1379 mSDtfsCounter, 1130 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:08:32,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2573 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:08:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63375 states. [2022-07-14 00:08:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63375 to 62395. [2022-07-14 00:08:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62395 states, 47152 states have (on average 1.2852265015269766) internal successors, (60601), 47967 states have internal predecessors, (60601), 10204 states have call successors, (10204), 4789 states have call predecessors, (10204), 5038 states have return successors, (11346), 9854 states have call predecessors, (11346), 10203 states have call successors, (11346) [2022-07-14 00:08:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62395 states to 62395 states and 82151 transitions. [2022-07-14 00:08:38,042 INFO L78 Accepts]: Start accepts. Automaton has 62395 states and 82151 transitions. Word has length 271 [2022-07-14 00:08:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:08:38,042 INFO L495 AbstractCegarLoop]: Abstraction has 62395 states and 82151 transitions. [2022-07-14 00:08:38,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 3 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 00:08:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 62395 states and 82151 transitions. [2022-07-14 00:08:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-14 00:08:38,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:08:38,115 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:08:38,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-14 00:08:38,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-14 00:08:38,317 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:08:38,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:08:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash -361911741, now seen corresponding path program 1 times [2022-07-14 00:08:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:08:38,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387553862] [2022-07-14 00:08:38,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:08:38,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:08:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:08:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:08:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:08:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 00:08:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:08:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:08:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 00:08:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:08:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:08:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:08:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:08:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 00:08:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:08:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 00:08:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:08:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-14 00:08:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-14 00:08:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-14 00:08:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-14 00:08:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-07-14 00:08:38,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:08:38,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387553862] [2022-07-14 00:08:38,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387553862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:08:38,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:08:38,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:08:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365391393] [2022-07-14 00:08:38,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:08:38,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:08:38,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:08:38,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:08:38,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:08:38,652 INFO L87 Difference]: Start difference. First operand 62395 states and 82151 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-14 00:08:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:08:50,038 INFO L93 Difference]: Finished difference Result 146088 states and 199720 transitions. [2022-07-14 00:08:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 00:08:50,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 271 [2022-07-14 00:08:50,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:08:50,526 INFO L225 Difference]: With dead ends: 146088 [2022-07-14 00:08:50,526 INFO L226 Difference]: Without dead ends: 105214 [2022-07-14 00:08:50,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:08:50,607 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 3137 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 1867 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3212 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 3476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1867 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:08:50,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3212 Valid, 2953 Invalid, 3476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1867 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 00:08:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105214 states. [2022-07-14 00:08:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105214 to 82662. [2022-07-14 00:08:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82662 states, 62259 states have (on average 1.2801683290769206) internal successors, (79702), 63364 states have internal predecessors, (79702), 13705 states have call successors, (13705), 6298 states have call predecessors, (13705), 6697 states have return successors, (15249), 13323 states have call predecessors, (15249), 13704 states have call successors, (15249) [2022-07-14 00:08:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82662 states to 82662 states and 108656 transitions. [2022-07-14 00:08:58,311 INFO L78 Accepts]: Start accepts. Automaton has 82662 states and 108656 transitions. Word has length 271 [2022-07-14 00:08:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:08:58,312 INFO L495 AbstractCegarLoop]: Abstraction has 82662 states and 108656 transitions. [2022-07-14 00:08:58,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-14 00:08:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 82662 states and 108656 transitions. [2022-07-14 00:08:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-14 00:08:58,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:08:58,389 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:08:58,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 00:08:58,389 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:08:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:08:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1711416516, now seen corresponding path program 1 times [2022-07-14 00:08:58,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:08:58,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191632152] [2022-07-14 00:08:58,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:08:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:08:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:08:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:08:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:08:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:08:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 00:08:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 00:08:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:08:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-14 00:08:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:08:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-14 00:08:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:08:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:58,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:08:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 00:08:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:08:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:08:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 00:08:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:08:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-14 00:08:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:08:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-14 00:08:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-14 00:08:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-14 00:08:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-14 00:08:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:08:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-07-14 00:08:59,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:08:59,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191632152] [2022-07-14 00:08:59,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191632152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:08:59,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538143640] [2022-07-14 00:08:59,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:08:59,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:08:59,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:08:59,232 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:08:59,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-14 00:09:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:09:00,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 3309 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-14 00:09:00,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:09:00,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-14 00:09:00,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-14 00:09:00,594 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:09:00,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 00:09:00,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:09:00,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-14 00:09:00,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:09:00,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 00:09:00,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-14 00:09:00,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-14 00:09:00,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-14 00:09:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 127 proven. 12 refuted. 5 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-14 00:09:00,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:09:02,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_12513 Int) (v_ArrVal_12511 Int) (v_ArrVal_12510 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_12511) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_12510) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_12513)) 26) 1))) is different from false [2022-07-14 00:09:02,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_12513 Int) (v_ArrVal_12511 Int) (v_ArrVal_12510 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_12511) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_12510) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_12513)) 26) 1))) is different from false [2022-07-14 00:09:03,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_12513 Int) (v_ArrVal_12511 Int) (v_ArrVal_12510 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_12511) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_12510) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_12513)) 26) 1))) is different from false [2022-07-14 00:09:04,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_12513 Int) (v_ArrVal_12511 Int) (v_ArrVal_12510 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_12511) 930 v_ArrVal_12510) 0 v_ArrVal_12513)) 26) 1))) is different from false [2022-07-14 00:09:04,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538143640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:09:04,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:09:04,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2022-07-14 00:09:04,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4680490] [2022-07-14 00:09:04,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:09:04,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 00:09:04,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:09:04,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 00:09:04,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1375, Unknown=5, NotChecked=308, Total=1806 [2022-07-14 00:09:04,291 INFO L87 Difference]: Start difference. First operand 82662 states and 108656 transitions. Second operand has 35 states, 34 states have (on average 8.441176470588236) internal successors, (287), 27 states have internal predecessors, (287), 13 states have call successors, (55), 10 states have call predecessors, (55), 11 states have return successors, (54), 15 states have call predecessors, (54), 13 states have call successors, (54) [2022-07-14 00:09:36,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:09:36,404 INFO L93 Difference]: Finished difference Result 244918 states and 329079 transitions. [2022-07-14 00:09:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-07-14 00:09:36,407 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 8.441176470588236) internal successors, (287), 27 states have internal predecessors, (287), 13 states have call successors, (55), 10 states have call predecessors, (55), 11 states have return successors, (54), 15 states have call predecessors, (54), 13 states have call successors, (54) Word has length 271 [2022-07-14 00:09:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:09:37,368 INFO L225 Difference]: With dead ends: 244918 [2022-07-14 00:09:37,368 INFO L226 Difference]: Without dead ends: 183693 [2022-07-14 00:09:37,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2956 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=882, Invalid=9229, Unknown=5, NotChecked=804, Total=10920 [2022-07-14 00:09:37,557 INFO L413 NwaCegarLoop]: 1690 mSDtfsCounter, 3265 mSDsluCounter, 21259 mSDsCounter, 0 mSdLazyCounter, 17140 mSolverCounterSat, 1668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3384 SdHoareTripleChecker+Valid, 22949 SdHoareTripleChecker+Invalid, 20341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1668 IncrementalHoareTripleChecker+Valid, 17140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1533 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:09:37,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3384 Valid, 22949 Invalid, 20341 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1668 Valid, 17140 Invalid, 0 Unknown, 1533 Unchecked, 11.4s Time] [2022-07-14 00:09:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183693 states.