./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.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 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 23:38:39,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:38:39,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:38:39,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:38:39,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:38:39,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:38:39,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:38:39,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:38:39,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:38:39,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:38:39,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:38:39,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:38:39,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:38:39,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:38:39,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:38:39,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:38:39,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:38:39,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:38:39,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:38:39,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:38:39,524 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:38:39,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:38:39,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:38:39,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:38:39,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:38:39,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:38:39,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:38:39,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:38:39,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:38:39,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:38:39,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:38:39,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:38:39,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:38:39,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:38:39,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:38:39,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:38:39,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:38:39,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:38:39,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:38:39,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:38:39,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:38:39,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:38:39,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 23:38:39,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:38:39,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:38:39,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:38:39,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:38:39,596 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:38:39,596 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:38:39,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:38:39,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:38:39,597 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:38:39,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:38:39,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 23:38:39,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:38:39,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:38:39,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:38:39,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:38:39,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:38:39,599 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:38:39,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:38:39,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:38:39,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:38:39,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:38:39,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:38:39,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:38:39,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:38:39,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:38:39,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 23:38:39,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 23:38:39,616 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:38:39,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:38:39,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:38:39,617 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 -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2022-07-19 23:38:39,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:38:39,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:38:39,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:38:39,867 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:38:39,868 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:38:39,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-07-19 23:38:39,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a734fd6d/d479a8712b8845a39bc2cdcb4919b8f1/FLAG2ed2cfa50 [2022-07-19 23:38:40,606 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:38:40,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-07-19 23:38:40,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a734fd6d/d479a8712b8845a39bc2cdcb4919b8f1/FLAG2ed2cfa50 [2022-07-19 23:38:40,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a734fd6d/d479a8712b8845a39bc2cdcb4919b8f1 [2022-07-19 23:38:40,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:38:40,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:38:40,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:38:40,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:38:40,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:38:40,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:38:40" (1/1) ... [2022-07-19 23:38:40,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70583dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:40, skipping insertion in model container [2022-07-19 23:38:40,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:38:40" (1/1) ... [2022-07-19 23:38:40,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:38:40,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:38:41,380 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2022-07-19 23:38:41,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:38:41,656 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:38:41,786 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.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2022-07-19 23:38:41,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:38:41,893 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:38:41,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41 WrapperNode [2022-07-19 23:38:41,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:38:41,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:38:41,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:38:41,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:38:41,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:41,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:42,014 INFO L137 Inliner]: procedures = 102, calls = 315, calls flagged for inlining = 35, calls inlined = 32, statements flattened = 987 [2022-07-19 23:38:42,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:38:42,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:38:42,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:38:42,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:38:42,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:42,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:42,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:42,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:42,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:42,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:42,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:42,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:38:42,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:38:42,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:38:42,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:38:42,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (1/1) ... [2022-07-19 23:38:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:38:42,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:38:42,141 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-19 23:38:42,168 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-19 23:38:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 23:38:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 23:38:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 23:38:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-19 23:38:42,194 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-19 23:38:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:38:42,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:38:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 23:38:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2022-07-19 23:38:42,194 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2022-07-19 23:38:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-07-19 23:38:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-07-19 23:38:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 23:38:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 23:38:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-19 23:38:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-19 23:38:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:38:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:38:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2022-07-19 23:38:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2022-07-19 23:38:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2022-07-19 23:38:42,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2022-07-19 23:38:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-19 23:38:42,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-19 23:38:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 23:38:42,197 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 23:38:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 23:38:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:38:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:38:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-19 23:38:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-19 23:38:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 23:38:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 23:38:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2022-07-19 23:38:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2022-07-19 23:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:38:42,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:38:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-19 23:38:42,200 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-19 23:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-19 23:38:42,200 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-19 23:38:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2022-07-19 23:38:42,201 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2022-07-19 23:38:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 23:38:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 23:38:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:38:42,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:38:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:38:42,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:38:42,621 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:38:42,623 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:38:42,759 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-19 23:38:43,839 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 23:38:43,848 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 23:38:43,848 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 23:38:43,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:38:43 BoogieIcfgContainer [2022-07-19 23:38:43,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 23:38:43,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 23:38:43,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 23:38:43,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 23:38:43,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:38:40" (1/3) ... [2022-07-19 23:38:43,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553bbd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:38:43, skipping insertion in model container [2022-07-19 23:38:43,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:38:41" (2/3) ... [2022-07-19 23:38:43,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553bbd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:38:43, skipping insertion in model container [2022-07-19 23:38:43,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:38:43" (3/3) ... [2022-07-19 23:38:43,858 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-07-19 23:38:43,871 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 23:38:43,871 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 23:38:43,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 23:38:43,953 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@666cf87f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34cdddb1 [2022-07-19 23:38:43,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 23:38:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 230 states have (on average 1.4) internal successors, (322), 236 states have internal predecessors, (322), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-07-19 23:38:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 23:38:43,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:43,972 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 23:38:43,973 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1372626135, now seen corresponding path program 1 times [2022-07-19 23:38:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:43,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674540676] [2022-07-19 23:38:43,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:38:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 23:38:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 23:38:44,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:44,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674540676] [2022-07-19 23:38:44,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674540676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:44,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:44,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:38:44,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357936986] [2022-07-19 23:38:44,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:38:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:44,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:38:44,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:38:44,543 INFO L87 Difference]: Start difference. First operand has 306 states, 230 states have (on average 1.4) internal successors, (322), 236 states have internal predecessors, (322), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 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-19 23:38:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:47,536 INFO L93 Difference]: Finished difference Result 1045 states and 1591 transitions. [2022-07-19 23:38:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:38:47,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 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 36 [2022-07-19 23:38:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:47,557 INFO L225 Difference]: With dead ends: 1045 [2022-07-19 23:38:47,557 INFO L226 Difference]: Without dead ends: 728 [2022-07-19 23:38:47,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:38:47,569 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 840 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:47,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1255 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-19 23:38:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-07-19 23:38:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 553. [2022-07-19 23:38:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 423 states have (on average 1.375886524822695) internal successors, (582), 423 states have internal predecessors, (582), 94 states have call successors, (94), 36 states have call predecessors, (94), 35 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-07-19 23:38:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 769 transitions. [2022-07-19 23:38:47,674 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 769 transitions. Word has length 36 [2022-07-19 23:38:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:47,675 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 769 transitions. [2022-07-19 23:38:47,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 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-19 23:38:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 769 transitions. [2022-07-19 23:38:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 23:38:47,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:47,679 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 23:38:47,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 23:38:47,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2092020101, now seen corresponding path program 1 times [2022-07-19 23:38:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:47,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125771457] [2022-07-19 23:38:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:38:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 23:38:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:38:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 23:38:47,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:47,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125771457] [2022-07-19 23:38:47,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125771457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:47,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:47,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:38:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91820284] [2022-07-19 23:38:47,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:47,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:38:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:38:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:38:47,896 INFO L87 Difference]: Start difference. First operand 553 states and 769 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 23:38:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:49,612 INFO L93 Difference]: Finished difference Result 1975 states and 2881 transitions. [2022-07-19 23:38:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:38:49,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-07-19 23:38:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:49,625 INFO L225 Difference]: With dead ends: 1975 [2022-07-19 23:38:49,626 INFO L226 Difference]: Without dead ends: 1430 [2022-07-19 23:38:49,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:38:49,630 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 850 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:49,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 2259 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 23:38:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2022-07-19 23:38:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1163. [2022-07-19 23:38:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 897 states have (on average 1.3812709030100334) internal successors, (1239), 899 states have internal predecessors, (1239), 188 states have call successors, (188), 70 states have call predecessors, (188), 77 states have return successors, (215), 193 states have call predecessors, (215), 187 states have call successors, (215) [2022-07-19 23:38:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1642 transitions. [2022-07-19 23:38:49,725 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1642 transitions. Word has length 46 [2022-07-19 23:38:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:49,726 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1642 transitions. [2022-07-19 23:38:49,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 23:38:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1642 transitions. [2022-07-19 23:38:49,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 23:38:49,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:49,736 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 23:38:49,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 23:38:49,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2091695119, now seen corresponding path program 1 times [2022-07-19 23:38:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:49,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644399650] [2022-07-19 23:38:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:49,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:49,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:38:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:49,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 23:38:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:38:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:49,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:38:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 23:38:50,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:50,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644399650] [2022-07-19 23:38:50,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644399650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:50,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:50,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:38:50,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942455145] [2022-07-19 23:38:50,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:50,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:38:50,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:50,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:38:50,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:38:50,005 INFO L87 Difference]: Start difference. First operand 1163 states and 1642 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:38:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:51,435 INFO L93 Difference]: Finished difference Result 2875 states and 4169 transitions. [2022-07-19 23:38:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:38:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2022-07-19 23:38:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:51,447 INFO L225 Difference]: With dead ends: 2875 [2022-07-19 23:38:51,448 INFO L226 Difference]: Without dead ends: 1726 [2022-07-19 23:38:51,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:38:51,459 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 477 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:51,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1153 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 23:38:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2022-07-19 23:38:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1384. [2022-07-19 23:38:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1095 states have (on average 1.3990867579908677) internal successors, (1532), 1097 states have internal predecessors, (1532), 201 states have call successors, (201), 80 states have call predecessors, (201), 87 states have return successors, (228), 206 states have call predecessors, (228), 200 states have call successors, (228) [2022-07-19 23:38:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1961 transitions. [2022-07-19 23:38:51,553 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1961 transitions. Word has length 84 [2022-07-19 23:38:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:51,555 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 1961 transitions. [2022-07-19 23:38:51,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:38:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1961 transitions. [2022-07-19 23:38:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 23:38:51,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:51,561 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-19 23:38:51,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 23:38:51,562 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1899779352, now seen corresponding path program 1 times [2022-07-19 23:38:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:51,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305497673] [2022-07-19 23:38:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:51,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:38:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 23:38:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:38:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 23:38:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:38:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:38:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:38:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-19 23:38:51,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:51,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305497673] [2022-07-19 23:38:51,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305497673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:51,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:51,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:38:51,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108192175] [2022-07-19 23:38:51,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:51,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:38:51,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:51,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:38:51,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:38:51,866 INFO L87 Difference]: Start difference. First operand 1384 states and 1961 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 23:38:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:54,901 INFO L93 Difference]: Finished difference Result 4181 states and 6057 transitions. [2022-07-19 23:38:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:38:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2022-07-19 23:38:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:54,917 INFO L225 Difference]: With dead ends: 4181 [2022-07-19 23:38:54,918 INFO L226 Difference]: Without dead ends: 2822 [2022-07-19 23:38:54,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:38:54,924 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 767 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:54,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1685 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-19 23:38:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2022-07-19 23:38:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2180. [2022-07-19 23:38:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1729 states have (on average 1.3846153846153846) internal successors, (2394), 1733 states have internal predecessors, (2394), 303 states have call successors, (303), 132 states have call predecessors, (303), 147 states have return successors, (347), 314 states have call predecessors, (347), 302 states have call successors, (347) [2022-07-19 23:38:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3044 transitions. [2022-07-19 23:38:55,037 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3044 transitions. Word has length 112 [2022-07-19 23:38:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:55,037 INFO L495 AbstractCegarLoop]: Abstraction has 2180 states and 3044 transitions. [2022-07-19 23:38:55,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 23:38:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3044 transitions. [2022-07-19 23:38:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 23:38:55,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:55,045 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-19 23:38:55,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 23:38:55,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash -80175978, now seen corresponding path program 1 times [2022-07-19 23:38:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:55,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677334878] [2022-07-19 23:38:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:55,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:38:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 23:38:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:38:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 23:38:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:38:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:38:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 23:38:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-19 23:38:55,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:55,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677334878] [2022-07-19 23:38:55,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677334878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:55,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:55,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 23:38:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470939305] [2022-07-19 23:38:55,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:55,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 23:38:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:55,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 23:38:55,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:38:55,403 INFO L87 Difference]: Start difference. First operand 2180 states and 3044 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-19 23:38:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:38:57,304 INFO L93 Difference]: Finished difference Result 5056 states and 7336 transitions. [2022-07-19 23:38:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 23:38:57,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2022-07-19 23:38:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:38:57,323 INFO L225 Difference]: With dead ends: 5056 [2022-07-19 23:38:57,323 INFO L226 Difference]: Without dead ends: 2901 [2022-07-19 23:38:57,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-07-19 23:38:57,332 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 286 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:38:57,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 2042 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 23:38:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2022-07-19 23:38:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2232. [2022-07-19 23:38:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 1765 states have (on average 1.3767705382436262) internal successors, (2430), 1777 states have internal predecessors, (2430), 303 states have call successors, (303), 132 states have call predecessors, (303), 163 states have return successors, (371), 322 states have call predecessors, (371), 302 states have call successors, (371) [2022-07-19 23:38:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3104 transitions. [2022-07-19 23:38:57,450 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3104 transitions. Word has length 112 [2022-07-19 23:38:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:38:57,451 INFO L495 AbstractCegarLoop]: Abstraction has 2232 states and 3104 transitions. [2022-07-19 23:38:57,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-19 23:38:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3104 transitions. [2022-07-19 23:38:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-19 23:38:57,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:38:57,457 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-19 23:38:57,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 23:38:57,458 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:38:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:38:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1707497592, now seen corresponding path program 1 times [2022-07-19 23:38:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:38:57,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688843964] [2022-07-19 23:38:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:38:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:38:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:38:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 23:38:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:38:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 23:38:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:38:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:38:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 23:38:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:38:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:38:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 23:38:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:38:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-19 23:38:57,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:38:57,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688843964] [2022-07-19 23:38:57,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688843964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:38:57,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:38:57,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 23:38:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144130062] [2022-07-19 23:38:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:38:57,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 23:38:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:38:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 23:38:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:38:57,878 INFO L87 Difference]: Start difference. First operand 2232 states and 3104 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 23:39:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:00,622 INFO L93 Difference]: Finished difference Result 5416 states and 7968 transitions. [2022-07-19 23:39:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 23:39:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2022-07-19 23:39:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:00,642 INFO L225 Difference]: With dead ends: 5416 [2022-07-19 23:39:00,643 INFO L226 Difference]: Without dead ends: 3209 [2022-07-19 23:39:00,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-19 23:39:00,655 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 275 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:00,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 2289 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 23:39:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2022-07-19 23:39:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2412. [2022-07-19 23:39:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2412 states, 1877 states have (on average 1.3670751198721365) internal successors, (2566), 1893 states have internal predecessors, (2566), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) [2022-07-19 23:39:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3439 transitions. [2022-07-19 23:39:00,806 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3439 transitions. Word has length 118 [2022-07-19 23:39:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:00,807 INFO L495 AbstractCegarLoop]: Abstraction has 2412 states and 3439 transitions. [2022-07-19 23:39:00,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 23:39:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3439 transitions. [2022-07-19 23:39:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-19 23:39:00,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:00,811 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 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] [2022-07-19 23:39:00,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 23:39:00,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash -115467208, now seen corresponding path program 1 times [2022-07-19 23:39:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:00,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065079774] [2022-07-19 23:39:00,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:00,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:00,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:39:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 23:39:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 23:39:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 23:39:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 23:39:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 23:39:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 23:39:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:39:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:39:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-19 23:39:01,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:01,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065079774] [2022-07-19 23:39:01,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065079774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:39:01,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609572018] [2022-07-19 23:39:01,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:01,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:39:01,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:39:01,144 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-19 23:39:01,148 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-19 23:39:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:01,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 23:39:01,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-19 23:39:01,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:39:01,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609572018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:01,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:39:01,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2022-07-19 23:39:01,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857266915] [2022-07-19 23:39:01,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:01,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:39:01,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:01,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:39:01,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:39:01,580 INFO L87 Difference]: Start difference. First operand 2412 states and 3439 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 23:39:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:01,756 INFO L93 Difference]: Finished difference Result 4809 states and 6863 transitions. [2022-07-19 23:39:01,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:39:01,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2022-07-19 23:39:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:01,783 INFO L225 Difference]: With dead ends: 4809 [2022-07-19 23:39:01,783 INFO L226 Difference]: Without dead ends: 2413 [2022-07-19 23:39:01,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:39:01,804 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 2 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:01,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1215 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 23:39:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2022-07-19 23:39:01,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2413. [2022-07-19 23:39:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2413 states, 1878 states have (on average 1.3668796592119277) internal successors, (2567), 1894 states have internal predecessors, (2567), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) [2022-07-19 23:39:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 3440 transitions. [2022-07-19 23:39:01,932 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 3440 transitions. Word has length 125 [2022-07-19 23:39:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:01,932 INFO L495 AbstractCegarLoop]: Abstraction has 2413 states and 3440 transitions. [2022-07-19 23:39:01,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 23:39:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3440 transitions. [2022-07-19 23:39:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 23:39:01,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:01,937 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2022-07-19 23:39:01,969 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-19 23:39:02,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:39:02,156 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash 222542747, now seen corresponding path program 1 times [2022-07-19 23:39:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:02,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479951676] [2022-07-19 23:39:02,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:39:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:39:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:39:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:39:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:39:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:39:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 23:39:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:39:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 23:39:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:39:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:39:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-19 23:39:02,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:02,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479951676] [2022-07-19 23:39:02,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479951676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:02,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:02,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 23:39:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739380755] [2022-07-19 23:39:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:02,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 23:39:02,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 23:39:02,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:39:02,423 INFO L87 Difference]: Start difference. First operand 2413 states and 3440 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 23:39:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:04,799 INFO L93 Difference]: Finished difference Result 5634 states and 8287 transitions. [2022-07-19 23:39:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 23:39:04,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 147 [2022-07-19 23:39:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:04,819 INFO L225 Difference]: With dead ends: 5634 [2022-07-19 23:39:04,819 INFO L226 Difference]: Without dead ends: 3247 [2022-07-19 23:39:04,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-19 23:39:04,829 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 386 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:04,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1458 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 23:39:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2022-07-19 23:39:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2425. [2022-07-19 23:39:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2425 states, 1890 states have (on average 1.3645502645502645) internal successors, (2579), 1906 states have internal predecessors, (2579), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) [2022-07-19 23:39:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2425 states to 2425 states and 3452 transitions. [2022-07-19 23:39:04,955 INFO L78 Accepts]: Start accepts. Automaton has 2425 states and 3452 transitions. Word has length 147 [2022-07-19 23:39:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:04,956 INFO L495 AbstractCegarLoop]: Abstraction has 2425 states and 3452 transitions. [2022-07-19 23:39:04,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 23:39:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 3452 transitions. [2022-07-19 23:39:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 23:39:04,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:04,960 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2022-07-19 23:39:04,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 23:39:04,960 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1788608796, now seen corresponding path program 1 times [2022-07-19 23:39:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:04,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268454818] [2022-07-19 23:39:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:39:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:39:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:39:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 23:39:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:39:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:39:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 23:39:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:39:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:39:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-19 23:39:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:05,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268454818] [2022-07-19 23:39:05,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268454818] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:39:05,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654860422] [2022-07-19 23:39:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:05,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:39:05,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:39:05,359 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-19 23:39:05,387 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-19 23:39:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:05,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 23:39:05,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-19 23:39:06,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:39:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-19 23:39:06,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654860422] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 23:39:06,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 23:39:06,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2022-07-19 23:39:06,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100770101] [2022-07-19 23:39:06,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 23:39:06,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 23:39:06,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 23:39:06,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-19 23:39:06,229 INFO L87 Difference]: Start difference. First operand 2425 states and 3452 transitions. Second operand has 15 states, 15 states have (on average 8.6) internal successors, (129), 10 states have internal predecessors, (129), 2 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 23:39:07,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:39:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:09,442 INFO L93 Difference]: Finished difference Result 5661 states and 8264 transitions. [2022-07-19 23:39:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 23:39:09,442 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.6) internal successors, (129), 10 states have internal predecessors, (129), 2 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 127 [2022-07-19 23:39:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:09,460 INFO L225 Difference]: With dead ends: 5661 [2022-07-19 23:39:09,460 INFO L226 Difference]: Without dead ends: 3250 [2022-07-19 23:39:09,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2022-07-19 23:39:09,469 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 308 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:09,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1875 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-19 23:39:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2022-07-19 23:39:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2428. [2022-07-19 23:39:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 1893 states have (on average 1.363972530375066) internal successors, (2582), 1909 states have internal predecessors, (2582), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) [2022-07-19 23:39:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3455 transitions. [2022-07-19 23:39:09,592 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3455 transitions. Word has length 127 [2022-07-19 23:39:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:09,592 INFO L495 AbstractCegarLoop]: Abstraction has 2428 states and 3455 transitions. [2022-07-19 23:39:09,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.6) internal successors, (129), 10 states have internal predecessors, (129), 2 states have call successors, (37), 7 states have call predecessors, (37), 5 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 23:39:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3455 transitions. [2022-07-19 23:39:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-19 23:39:09,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:09,597 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 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] [2022-07-19 23:39:09,625 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-19 23:39:09,819 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,SelfDestructingSolverStorable8 [2022-07-19 23:39:09,820 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash 728737592, now seen corresponding path program 2 times [2022-07-19 23:39:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:09,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021041428] [2022-07-19 23:39:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:09,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:09,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:39:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:39:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:39:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:39:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 23:39:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:39:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:39:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:39:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-19 23:39:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:10,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021041428] [2022-07-19 23:39:10,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021041428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:10,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:10,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-19 23:39:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775069221] [2022-07-19 23:39:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:10,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 23:39:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:10,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 23:39:10,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2022-07-19 23:39:10,499 INFO L87 Difference]: Start difference. First operand 2428 states and 3455 transitions. Second operand has 21 states, 20 states have (on average 4.05) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 23:39:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:15,116 INFO L93 Difference]: Finished difference Result 5773 states and 8550 transitions. [2022-07-19 23:39:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 23:39:15,117 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.05) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) Word has length 133 [2022-07-19 23:39:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:15,137 INFO L225 Difference]: With dead ends: 5773 [2022-07-19 23:39:15,137 INFO L226 Difference]: Without dead ends: 3374 [2022-07-19 23:39:15,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2022-07-19 23:39:15,147 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 265 mSDsluCounter, 5707 mSDsCounter, 0 mSdLazyCounter, 3170 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 6194 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 3170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:15,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 6194 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 3170 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 23:39:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2022-07-19 23:39:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 2452. [2022-07-19 23:39:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1913 states have (on average 1.3538944066910612) internal successors, (2590), 1921 states have internal predecessors, (2590), 363 states have call successors, (363), 132 states have call predecessors, (363), 175 states have return successors, (522), 398 states have call predecessors, (522), 362 states have call successors, (522) [2022-07-19 23:39:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3475 transitions. [2022-07-19 23:39:15,292 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3475 transitions. Word has length 133 [2022-07-19 23:39:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:15,292 INFO L495 AbstractCegarLoop]: Abstraction has 2452 states and 3475 transitions. [2022-07-19 23:39:15,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.05) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 23:39:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3475 transitions. [2022-07-19 23:39:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-19 23:39:15,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:15,297 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 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] [2022-07-19 23:39:15,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 23:39:15,297 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash -672213703, now seen corresponding path program 1 times [2022-07-19 23:39:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:15,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322635566] [2022-07-19 23:39:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:39:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:39:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:39:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:39:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 23:39:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:39:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:39:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 23:39:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:16,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:39:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:39:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-19 23:39:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:16,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322635566] [2022-07-19 23:39:16,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322635566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:16,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:16,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-19 23:39:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398641452] [2022-07-19 23:39:16,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:16,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 23:39:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 23:39:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2022-07-19 23:39:16,142 INFO L87 Difference]: Start difference. First operand 2452 states and 3475 transitions. Second operand has 21 states, 20 states have (on average 4.7) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 23:39:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:19,788 INFO L93 Difference]: Finished difference Result 5949 states and 8766 transitions. [2022-07-19 23:39:19,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 23:39:19,790 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) Word has length 153 [2022-07-19 23:39:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:19,818 INFO L225 Difference]: With dead ends: 5949 [2022-07-19 23:39:19,819 INFO L226 Difference]: Without dead ends: 3526 [2022-07-19 23:39:19,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2022-07-19 23:39:19,831 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 341 mSDsluCounter, 5250 mSDsCounter, 0 mSdLazyCounter, 3013 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 5715 SdHoareTripleChecker+Invalid, 3202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 3013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:19,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 5715 Invalid, 3202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 3013 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-19 23:39:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2022-07-19 23:39:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 2468. [2022-07-19 23:39:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 1929 states have (on average 1.3509590461378953) internal successors, (2606), 1929 states have internal predecessors, (2606), 363 states have call successors, (363), 132 states have call predecessors, (363), 175 states have return successors, (522), 406 states have call predecessors, (522), 362 states have call successors, (522) [2022-07-19 23:39:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3491 transitions. [2022-07-19 23:39:20,025 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3491 transitions. Word has length 153 [2022-07-19 23:39:20,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:20,025 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 3491 transitions. [2022-07-19 23:39:20,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 23:39:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3491 transitions. [2022-07-19 23:39:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-19 23:39:20,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:20,033 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 3, 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] [2022-07-19 23:39:20,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 23:39:20,033 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -900196334, now seen corresponding path program 1 times [2022-07-19 23:39:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:20,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808687169] [2022-07-19 23:39:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:20,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:39:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:39:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:39:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:39:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 23:39:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:39:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:39:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 23:39:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:39:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:39:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:39:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 23:39:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 23:39:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:39:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-07-19 23:39:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808687169] [2022-07-19 23:39:20,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808687169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:20,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:20,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 23:39:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413457285] [2022-07-19 23:39:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:20,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 23:39:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 23:39:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:39:20,513 INFO L87 Difference]: Start difference. First operand 2468 states and 3491 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 6 states have internal predecessors, (107), 4 states have call successors, (20), 7 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 23:39:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:24,169 INFO L93 Difference]: Finished difference Result 7213 states and 11094 transitions. [2022-07-19 23:39:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 23:39:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 6 states have internal predecessors, (107), 4 states have call successors, (20), 7 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 183 [2022-07-19 23:39:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:24,196 INFO L225 Difference]: With dead ends: 7213 [2022-07-19 23:39:24,197 INFO L226 Difference]: Without dead ends: 4774 [2022-07-19 23:39:24,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-07-19 23:39:24,213 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 324 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:24,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 3111 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-19 23:39:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4774 states. [2022-07-19 23:39:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4774 to 2844. [2022-07-19 23:39:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2217 states have (on average 1.363103292737934) internal successors, (3022), 2217 states have internal predecessors, (3022), 443 states have call successors, (443), 132 states have call predecessors, (443), 183 states have return successors, (722), 494 states have call predecessors, (722), 442 states have call successors, (722) [2022-07-19 23:39:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4187 transitions. [2022-07-19 23:39:24,493 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 4187 transitions. Word has length 183 [2022-07-19 23:39:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:24,495 INFO L495 AbstractCegarLoop]: Abstraction has 2844 states and 4187 transitions. [2022-07-19 23:39:24,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 6 states have internal predecessors, (107), 4 states have call successors, (20), 7 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 23:39:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 4187 transitions. [2022-07-19 23:39:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-19 23:39:24,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:24,506 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 3, 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] [2022-07-19 23:39:24,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 23:39:24,506 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:24,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:24,507 INFO L85 PathProgramCache]: Analyzing trace with hash 536068470, now seen corresponding path program 1 times [2022-07-19 23:39:24,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:24,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691220897] [2022-07-19 23:39:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:24,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:39:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:39:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:39:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:39:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 23:39:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:39:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:39:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:25,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:25,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:39:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:25,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:39:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:39:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 23:39:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 23:39:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 23:39:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 23:39:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-19 23:39:26,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:26,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691220897] [2022-07-19 23:39:26,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691220897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:39:26,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528961409] [2022-07-19 23:39:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:26,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:39:26,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:39:26,484 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-19 23:39:26,488 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-19 23:39:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:26,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 1593 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-19 23:39:27,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:39:32,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 23:39:46,861 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 23:39:46,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-19 23:39:51,154 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-19 23:39:51,154 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 2 case distinctions, treesize of input 24 treesize of output 36 [2022-07-19 23:39:51,165 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 9 treesize of output 5 [2022-07-19 23:39:51,182 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 9 treesize of output 5 [2022-07-19 23:39:53,571 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 23:39:53,571 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 1 case distinctions, treesize of input 25 treesize of output 31 [2022-07-19 23:39:53,829 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 26 treesize of output 14 [2022-07-19 23:39:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-19 23:39:54,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:39:54,239 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 165 treesize of output 153 [2022-07-19 23:39:54,246 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 146 treesize of output 130 [2022-07-19 23:39:54,251 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 130 treesize of output 122 [2022-07-19 23:39:54,256 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 122 treesize of output 118 [2022-07-19 23:39:54,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528961409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:39:54,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:39:54,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 27] total 63 [2022-07-19 23:39:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206545864] [2022-07-19 23:39:54,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:39:54,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-19 23:39:54,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:54,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-19 23:39:54,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=4312, Unknown=54, NotChecked=0, Total=4692 [2022-07-19 23:39:54,932 INFO L87 Difference]: Start difference. First operand 2844 states and 4187 transitions. Second operand has 63 states, 63 states have (on average 3.4761904761904763) internal successors, (219), 49 states have internal predecessors, (219), 22 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (39), 26 states have call predecessors, (39), 21 states have call successors, (39) [2022-07-19 23:39:58,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:39:59,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:40:05,278 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:40:08,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:40:09,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:41:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:15,779 INFO L93 Difference]: Finished difference Result 21135 states and 33114 transitions. [2022-07-19 23:41:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2022-07-19 23:41:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.4761904761904763) internal successors, (219), 49 states have internal predecessors, (219), 22 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (39), 26 states have call predecessors, (39), 21 states have call successors, (39) Word has length 184 [2022-07-19 23:41:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:15,875 INFO L225 Difference]: With dead ends: 21135 [2022-07-19 23:41:15,876 INFO L226 Difference]: Without dead ends: 19481 [2022-07-19 23:41:15,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 251 SyntacticMatches, 3 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15524 ImplicationChecksByTransitivity, 70.0s TimeCoverageRelationStatistics Valid=2989, Invalid=42467, Unknown=126, NotChecked=0, Total=45582 [2022-07-19 23:41:15,907 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 4688 mSDsluCounter, 11625 mSDsCounter, 0 mSdLazyCounter, 19094 mSolverCounterSat, 2714 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 12287 SdHoareTripleChecker+Invalid, 26581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2714 IncrementalHoareTripleChecker+Valid, 19094 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4772 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:15,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 12287 Invalid, 26581 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2714 Valid, 19094 Invalid, 1 Unknown, 4772 Unchecked, 36.3s Time] [2022-07-19 23:41:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19481 states. [2022-07-19 23:41:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19481 to 13871. [2022-07-19 23:41:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13871 states, 10836 states have (on average 1.3741232927279439) internal successors, (14890), 10828 states have internal predecessors, (14890), 2179 states have call successors, (2179), 639 states have call predecessors, (2179), 855 states have return successors, (4163), 2403 states have call predecessors, (4163), 2178 states have call successors, (4163) [2022-07-19 23:41:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13871 states to 13871 states and 21232 transitions. [2022-07-19 23:41:17,215 INFO L78 Accepts]: Start accepts. Automaton has 13871 states and 21232 transitions. Word has length 184 [2022-07-19 23:41:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:17,216 INFO L495 AbstractCegarLoop]: Abstraction has 13871 states and 21232 transitions. [2022-07-19 23:41:17,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.4761904761904763) internal successors, (219), 49 states have internal predecessors, (219), 22 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (39), 26 states have call predecessors, (39), 21 states have call successors, (39) [2022-07-19 23:41:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 13871 states and 21232 transitions. [2022-07-19 23:41:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-19 23:41:17,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:17,248 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 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] [2022-07-19 23:41:17,280 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-19 23:41:17,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:17,463 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:17,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1288410356, now seen corresponding path program 1 times [2022-07-19 23:41:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:17,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540263328] [2022-07-19 23:41:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 23:41:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:41:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:41:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:17,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 23:41:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:41:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:17,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 23:41:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:41:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:18,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 23:41:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 23:41:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:41:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 23:41:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 23:41:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 23:41:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 25 proven. 13 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-19 23:41:19,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:19,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540263328] [2022-07-19 23:41:19,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540263328] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:19,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424060969] [2022-07-19 23:41:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:19,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:19,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:41:19,353 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-19 23:41:19,354 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-19 23:41:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:19,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-19 23:41:19,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:20,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 23:41:21,396 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 23:41:21,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-19 23:41:21,646 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-19 23:41:21,646 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 2 case distinctions, treesize of input 25 treesize of output 37 [2022-07-19 23:41:21,658 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 10 treesize of output 6 [2022-07-19 23:41:21,665 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 10 treesize of output 6 [2022-07-19 23:41:21,999 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 23:41:21,999 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 1 case distinctions, treesize of input 26 treesize of output 32 [2022-07-19 23:41:22,418 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 30 treesize of output 18 [2022-07-19 23:41:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 59 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-19 23:41:22,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:41:22,919 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 326 treesize of output 308 [2022-07-19 23:41:22,928 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 302 treesize of output 270 [2022-07-19 23:41:22,934 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 270 treesize of output 262 [2022-07-19 23:41:22,939 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 262 treesize of output 246 [2022-07-19 23:41:23,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424060969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:23,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:41:23,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 64 [2022-07-19 23:41:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461545403] [2022-07-19 23:41:23,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:41:23,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-19 23:41:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-19 23:41:23,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=4599, Unknown=24, NotChecked=0, Total=4970 [2022-07-19 23:41:23,707 INFO L87 Difference]: Start difference. First operand 13871 states and 21232 transitions. Second operand has 64 states, 59 states have (on average 3.4915254237288136) internal successors, (206), 49 states have internal predecessors, (206), 23 states have call successors, (39), 11 states have call predecessors, (39), 21 states have return successors, (38), 24 states have call predecessors, (38), 22 states have call successors, (38) [2022-07-19 23:41:27,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:41:30,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:41:35,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:41:37,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:42:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:42:30,974 INFO L93 Difference]: Finished difference Result 109575 states and 179382 transitions. [2022-07-19 23:42:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2022-07-19 23:42:30,975 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 59 states have (on average 3.4915254237288136) internal successors, (206), 49 states have internal predecessors, (206), 23 states have call successors, (39), 11 states have call predecessors, (39), 21 states have return successors, (38), 24 states have call predecessors, (38), 22 states have call successors, (38) Word has length 169 [2022-07-19 23:42:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:42:31,616 INFO L225 Difference]: With dead ends: 109575 [2022-07-19 23:42:31,616 INFO L226 Difference]: Without dead ends: 91462 [2022-07-19 23:42:31,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 246 SyntacticMatches, 3 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21522 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3646, Invalid=56059, Unknown=75, NotChecked=0, Total=59780 [2022-07-19 23:42:31,783 INFO L413 NwaCegarLoop]: 1146 mSDtfsCounter, 5664 mSDsluCounter, 19532 mSDsCounter, 0 mSdLazyCounter, 38025 mSolverCounterSat, 4143 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5959 SdHoareTripleChecker+Valid, 20678 SdHoareTripleChecker+Invalid, 49632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4143 IncrementalHoareTripleChecker+Valid, 38025 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 7463 IncrementalHoareTripleChecker+Unchecked, 49.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:42:31,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5959 Valid, 20678 Invalid, 49632 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4143 Valid, 38025 Invalid, 1 Unknown, 7463 Unchecked, 49.2s Time] [2022-07-19 23:42:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91462 states.