./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.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 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 10:54:55,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 10:54:55,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 10:54:55,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 10:54:55,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 10:54:55,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 10:54:55,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 10:54:55,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 10:54:55,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 10:54:55,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 10:54:55,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 10:54:55,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 10:54:55,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 10:54:55,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 10:54:55,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 10:54:55,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 10:54:55,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 10:54:55,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 10:54:55,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 10:54:55,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 10:54:55,684 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 10:54:55,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 10:54:55,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 10:54:55,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 10:54:55,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 10:54:55,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 10:54:55,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 10:54:55,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 10:54:55,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 10:54:55,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 10:54:55,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 10:54:55,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 10:54:55,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 10:54:55,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 10:54:55,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 10:54:55,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 10:54:55,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 10:54:55,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 10:54:55,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 10:54:55,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 10:54:55,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 10:54:55,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 10:54:55,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 10:54:55,720 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 10:54:55,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 10:54:55,721 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 10:54:55,721 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 10:54:55,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 10:54:55,722 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 10:54:55,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 10:54:55,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 10:54:55,723 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 10:54:55,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 10:54:55,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 10:54:55,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 10:54:55,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 10:54:55,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 10:54:55,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 10:54:55,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 10:54:55,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 10:54:55,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 10:54:55,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 10:54:55,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 10:54:55,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 10:54:55,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:54:55,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 10:54:55,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 10:54:55,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 10:54:55,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 10:54:55,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 10:54:55,727 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 10:54:55,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 10:54:55,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 10:54:55,727 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 -> 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f [2022-07-21 10:54:56,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 10:54:56,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 10:54:56,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 10:54:56,042 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 10:54:56,043 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 10:54:56,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-07-21 10:54:56,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565b22ad8/6c6c3419754e4f0faba0bd4f8aeeb253/FLAGc66fb7737 [2022-07-21 10:54:56,854 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 10:54:56,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-07-21 10:54:56,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565b22ad8/6c6c3419754e4f0faba0bd4f8aeeb253/FLAGc66fb7737 [2022-07-21 10:54:57,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565b22ad8/6c6c3419754e4f0faba0bd4f8aeeb253 [2022-07-21 10:54:57,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 10:54:57,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 10:54:57,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 10:54:57,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 10:54:57,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 10:54:57,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:54:57" (1/1) ... [2022-07-21 10:54:57,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253c07b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:57, skipping insertion in model container [2022-07-21 10:54:57,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:54:57" (1/1) ... [2022-07-21 10:54:57,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 10:54:57,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 10:54:57,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2022-07-21 10:54:58,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:54:58,268 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 10:54:58,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2022-07-21 10:54:58,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:54:58,665 INFO L208 MainTranslator]: Completed translation [2022-07-21 10:54:58,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58 WrapperNode [2022-07-21 10:54:58,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 10:54:58,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 10:54:58,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 10:54:58,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 10:54:58,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:58,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:58,984 INFO L137 Inliner]: procedures = 178, calls = 1868, calls flagged for inlining = 81, calls inlined = 81, statements flattened = 3566 [2022-07-21 10:54:58,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 10:54:58,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 10:54:58,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 10:54:58,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 10:54:58,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:58,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:59,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:59,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:59,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:59,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:59,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:59,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 10:54:59,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 10:54:59,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 10:54:59,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 10:54:59,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (1/1) ... [2022-07-21 10:54:59,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:54:59,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:54:59,242 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-21 10:54:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-21 10:54:59,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-21 10:54:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 10:54:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2022-07-21 10:54:59,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2022-07-21 10:54:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_8 [2022-07-21 10:54:59,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_8 [2022-07-21 10:54:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_5 [2022-07-21 10:54:59,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_5 [2022-07-21 10:54:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_6 [2022-07-21 10:54:59,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_6 [2022-07-21 10:54:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 10:54:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 10:54:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-21 10:54:59,302 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-21 10:54:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 10:54:59,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 10:54:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 10:54:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_20 [2022-07-21 10:54:59,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_20 [2022-07-21 10:54:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-21 10:54:59,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-21 10:54:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 10:54:59,303 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 10:54:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 10:54:59,303 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 10:54:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 10:54:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 10:54:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-21 10:54:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-21 10:54:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 10:54:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 10:54:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-21 10:54:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-21 10:54:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 10:54:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 10:54:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_resume [2022-07-21 10:54:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_resume [2022-07-21 10:54:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure kstrdup [2022-07-21 10:54:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrdup [2022-07-21 10:54:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-21 10:54:59,306 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-21 10:54:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_reset_resume [2022-07-21 10:54:59,306 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_reset_resume [2022-07-21 10:54:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 10:54:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-21 10:54:59,307 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-21 10:54:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 10:54:59,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 10:54:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-21 10:54:59,307 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-21 10:54:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 10:54:59,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 10:54:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 10:54:59,308 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 10:54:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 10:54:59,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 10:54:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 10:54:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-21 10:54:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-21 10:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_free_buffers [2022-07-21 10:54:59,311 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_free_buffers [2022-07-21 10:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_disconnect [2022-07-21 10:54:59,311 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_disconnect [2022-07-21 10:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_22 [2022-07-21 10:54:59,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_22 [2022-07-21 10:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 10:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 10:54:59,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 10:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 10:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 10:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-21 10:54:59,313 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-21 10:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-21 10:54:59,313 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-21 10:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 10:54:59,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 10:54:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 10:54:59,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 10:54:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 10:54:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-21 10:54:59,314 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-21 10:54:59,261 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-21 10:54:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_14 [2022-07-21 10:54:59,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_14 [2022-07-21 10:54:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_16 [2022-07-21 10:54:59,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_16 [2022-07-21 10:54:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2022-07-21 10:54:59,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2022-07-21 10:54:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_probe [2022-07-21 10:54:59,316 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_probe [2022-07-21 10:54:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 10:54:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2022-07-21 10:54:59,317 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2022-07-21 10:54:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 10:54:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-07-21 10:54:59,318 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-07-21 10:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_open [2022-07-21 10:54:59,318 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_open [2022-07-21 10:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_12 [2022-07-21 10:54:59,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_12 [2022-07-21 10:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 10:54:59,319 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 10:54:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 10:54:59,320 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 10:54:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-21 10:54:59,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-21 10:54:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_irq [2022-07-21 10:54:59,321 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_irq [2022-07-21 10:54:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:54:59,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:54:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_pkt [2022-07-21 10:54:59,321 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_pkt [2022-07-21 10:54:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-21 10:54:59,322 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-21 10:54:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2022-07-21 10:54:59,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2022-07-21 10:54:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-21 10:54:59,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-21 10:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 10:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_read_data [2022-07-21 10:54:59,325 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_read_data [2022-07-21 10:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-21 10:54:59,325 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-21 10:54:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 10:54:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 10:54:59,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 10:54:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 10:54:59,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 10:54:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2022-07-21 10:54:59,332 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2022-07-21 10:54:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_multi [2022-07-21 10:54:59,333 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_multi [2022-07-21 10:54:59,812 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 10:54:59,814 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 10:55:00,032 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 10:55:02,002 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-21 10:55:02,730 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 10:55:02,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 10:55:02,743 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 10:55:02,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:55:02 BoogieIcfgContainer [2022-07-21 10:55:02,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 10:55:02,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 10:55:02,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 10:55:02,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 10:55:02,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:54:57" (1/3) ... [2022-07-21 10:55:02,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fda8657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:55:02, skipping insertion in model container [2022-07-21 10:55:02,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:54:58" (2/3) ... [2022-07-21 10:55:02,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fda8657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:55:02, skipping insertion in model container [2022-07-21 10:55:02,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:55:02" (3/3) ... [2022-07-21 10:55:02,752 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-07-21 10:55:02,764 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 10:55:02,765 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 10:55:02,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 10:55:02,831 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@37e3d24c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@181da54c [2022-07-21 10:55:02,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 10:55:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 969 states, 704 states have (on average 1.359375) internal successors, (957), 723 states have internal predecessors, (957), 207 states have call successors, (207), 58 states have call predecessors, (207), 56 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2022-07-21 10:55:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 10:55:02,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:02,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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-21 10:55:02,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:02,853 INFO L85 PathProgramCache]: Analyzing trace with hash -84985716, now seen corresponding path program 1 times [2022-07-21 10:55:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:02,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150733604] [2022-07-21 10:55:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:03,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:03,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:55:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 10:55:03,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:03,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150733604] [2022-07-21 10:55:03,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150733604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:55:03,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:55:03,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:55:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726522019] [2022-07-21 10:55:03,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:55:03,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:55:03,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:03,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:55:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:55:03,449 INFO L87 Difference]: Start difference. First operand has 969 states, 704 states have (on average 1.359375) internal successors, (957), 723 states have internal predecessors, (957), 207 states have call successors, (207), 58 states have call predecessors, (207), 56 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 10:55:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:11,496 INFO L93 Difference]: Finished difference Result 3568 states and 5311 transitions. [2022-07-21 10:55:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:55:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-21 10:55:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:11,544 INFO L225 Difference]: With dead ends: 3568 [2022-07-21 10:55:11,544 INFO L226 Difference]: Without dead ends: 2580 [2022-07-21 10:55:11,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-21 10:55:11,568 INFO L413 NwaCegarLoop]: 1551 mSDtfsCounter, 3143 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 1595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3327 SdHoareTripleChecker+Valid, 3699 SdHoareTripleChecker+Invalid, 3883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1595 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:11,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3327 Valid, 3699 Invalid, 3883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1595 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-07-21 10:55:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-07-21 10:55:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1879. [2022-07-21 10:55:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1375 states have (on average 1.3447272727272728) internal successors, (1849), 1392 states have internal predecessors, (1849), 393 states have call successors, (393), 111 states have call predecessors, (393), 110 states have return successors, (387), 383 states have call predecessors, (387), 387 states have call successors, (387) [2022-07-21 10:55:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2629 transitions. [2022-07-21 10:55:11,792 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2629 transitions. Word has length 28 [2022-07-21 10:55:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:11,792 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2629 transitions. [2022-07-21 10:55:11,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 10:55:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2629 transitions. [2022-07-21 10:55:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 10:55:11,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:11,802 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, 1, 1] [2022-07-21 10:55:11,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 10:55:11,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:11,804 INFO L85 PathProgramCache]: Analyzing trace with hash 818955978, now seen corresponding path program 1 times [2022-07-21 10:55:11,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:11,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287741233] [2022-07-21 10:55:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:12,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:55:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:12,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:55:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:12,041 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-21 10:55:12,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:12,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287741233] [2022-07-21 10:55:12,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287741233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:55:12,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:55:12,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:55:12,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810955886] [2022-07-21 10:55:12,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:55:12,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:55:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:12,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:55:12,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:55:12,045 INFO L87 Difference]: Start difference. First operand 1879 states and 2629 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 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-21 10:55:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:18,089 INFO L93 Difference]: Finished difference Result 2603 states and 3754 transitions. [2022-07-21 10:55:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 10:55:18,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 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 38 [2022-07-21 10:55:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:18,105 INFO L225 Difference]: With dead ends: 2603 [2022-07-21 10:55:18,105 INFO L226 Difference]: Without dead ends: 2590 [2022-07-21 10:55:18,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:55:18,107 INFO L413 NwaCegarLoop]: 1220 mSDtfsCounter, 2273 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2396 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:18,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 2240 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-21 10:55:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2022-07-21 10:55:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 1879. [2022-07-21 10:55:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1375 states have (on average 1.344) internal successors, (1848), 1392 states have internal predecessors, (1848), 393 states have call successors, (393), 111 states have call predecessors, (393), 110 states have return successors, (387), 383 states have call predecessors, (387), 387 states have call successors, (387) [2022-07-21 10:55:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2628 transitions. [2022-07-21 10:55:18,194 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2628 transitions. Word has length 38 [2022-07-21 10:55:18,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:18,195 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2628 transitions. [2022-07-21 10:55:18,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 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-21 10:55:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2628 transitions. [2022-07-21 10:55:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 10:55:18,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:18,200 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, 1, 1] [2022-07-21 10:55:18,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 10:55:18,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 876214280, now seen corresponding path program 1 times [2022-07-21 10:55:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:18,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009763181] [2022-07-21 10:55:18,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:18,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:18,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:18,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:55:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:18,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:55:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:18,504 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-21 10:55:18,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:18,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009763181] [2022-07-21 10:55:18,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009763181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:55:18,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:55:18,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:55:18,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847823261] [2022-07-21 10:55:18,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:55:18,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:55:18,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:18,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:55:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:55:18,507 INFO L87 Difference]: Start difference. First operand 1879 states and 2628 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 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-21 10:55:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:25,526 INFO L93 Difference]: Finished difference Result 7002 states and 10466 transitions. [2022-07-21 10:55:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:55:25,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 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 38 [2022-07-21 10:55:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:25,558 INFO L225 Difference]: With dead ends: 7002 [2022-07-21 10:55:25,559 INFO L226 Difference]: Without dead ends: 5137 [2022-07-21 10:55:25,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:55:25,572 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 3267 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 1639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3433 SdHoareTripleChecker+Valid, 3612 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1639 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:25,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3433 Valid, 3612 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1639 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-21 10:55:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-07-21 10:55:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 4286. [2022-07-21 10:55:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 3139 states have (on average 1.3284485504937877) internal successors, (4170), 3172 states have internal predecessors, (4170), 851 states have call successors, (851), 220 states have call predecessors, (851), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-07-21 10:55:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 6232 transitions. [2022-07-21 10:55:25,779 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 6232 transitions. Word has length 38 [2022-07-21 10:55:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:25,780 INFO L495 AbstractCegarLoop]: Abstraction has 4286 states and 6232 transitions. [2022-07-21 10:55:25,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 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-21 10:55:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 6232 transitions. [2022-07-21 10:55:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 10:55:25,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:25,784 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, 1, 1, 1] [2022-07-21 10:55:25,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 10:55:25,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:25,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:25,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1392341914, now seen corresponding path program 1 times [2022-07-21 10:55:25,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:25,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225743715] [2022-07-21 10:55:25,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:25,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:55:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:55:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,043 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-21 10:55:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:26,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225743715] [2022-07-21 10:55:26,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225743715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:55:26,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:55:26,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:55:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241976436] [2022-07-21 10:55:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:55:26,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:55:26,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:55:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:55:26,046 INFO L87 Difference]: Start difference. First operand 4286 states and 6232 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 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-21 10:55:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:30,697 INFO L93 Difference]: Finished difference Result 5128 states and 7662 transitions. [2022-07-21 10:55:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:55:30,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 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 39 [2022-07-21 10:55:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:30,730 INFO L225 Difference]: With dead ends: 5128 [2022-07-21 10:55:30,730 INFO L226 Difference]: Without dead ends: 5125 [2022-07-21 10:55:30,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:55:30,735 INFO L413 NwaCegarLoop]: 1186 mSDtfsCounter, 2235 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2364 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:30,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2364 Valid, 2180 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1007 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-21 10:55:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5125 states. [2022-07-21 10:55:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5125 to 4285. [2022-07-21 10:55:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 3139 states have (on average 1.3281299776999045) internal successors, (4169), 3171 states have internal predecessors, (4169), 850 states have call successors, (850), 220 states have call predecessors, (850), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-07-21 10:55:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 6230 transitions. [2022-07-21 10:55:30,981 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 6230 transitions. Word has length 39 [2022-07-21 10:55:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:30,982 INFO L495 AbstractCegarLoop]: Abstraction has 4285 states and 6230 transitions. [2022-07-21 10:55:30,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 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-21 10:55:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 6230 transitions. [2022-07-21 10:55:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 10:55:30,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:30,984 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, 1, 1, 1, 1] [2022-07-21 10:55:30,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 10:55:30,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:30,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 212434251, now seen corresponding path program 1 times [2022-07-21 10:55:30,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:30,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346051526] [2022-07-21 10:55:30,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:30,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:31,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:55:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:31,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:55:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:31,202 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-21 10:55:31,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:31,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346051526] [2022-07-21 10:55:31,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346051526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:55:31,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:55:31,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:55:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301061977] [2022-07-21 10:55:31,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:55:31,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:55:31,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:31,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:55:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:55:31,204 INFO L87 Difference]: Start difference. First operand 4285 states and 6230 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 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-21 10:55:34,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:55:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:36,199 INFO L93 Difference]: Finished difference Result 5127 states and 7660 transitions. [2022-07-21 10:55:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:55:36,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 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 40 [2022-07-21 10:55:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:36,226 INFO L225 Difference]: With dead ends: 5127 [2022-07-21 10:55:36,226 INFO L226 Difference]: Without dead ends: 5124 [2022-07-21 10:55:36,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:55:36,230 INFO L413 NwaCegarLoop]: 1187 mSDtfsCounter, 2223 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 1005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2350 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1005 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:36,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2350 Valid, 2182 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1005 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-21 10:55:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2022-07-21 10:55:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 4284. [2022-07-21 10:55:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4284 states, 3139 states have (on average 1.327811404906021) internal successors, (4168), 3170 states have internal predecessors, (4168), 849 states have call successors, (849), 220 states have call predecessors, (849), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-07-21 10:55:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4284 states to 4284 states and 6228 transitions. [2022-07-21 10:55:36,455 INFO L78 Accepts]: Start accepts. Automaton has 4284 states and 6228 transitions. Word has length 40 [2022-07-21 10:55:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:36,456 INFO L495 AbstractCegarLoop]: Abstraction has 4284 states and 6228 transitions. [2022-07-21 10:55:36,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 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-21 10:55:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4284 states and 6228 transitions. [2022-07-21 10:55:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 10:55:36,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:36,458 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, 1, 1, 1, 1, 1] [2022-07-21 10:55:36,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 10:55:36,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:36,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2004960067, now seen corresponding path program 1 times [2022-07-21 10:55:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:36,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406175670] [2022-07-21 10:55:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:36,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:36,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:55:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:36,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:55:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:36,666 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-21 10:55:36,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:36,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406175670] [2022-07-21 10:55:36,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406175670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:55:36,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:55:36,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:55:36,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454376275] [2022-07-21 10:55:36,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:55:36,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:55:36,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:36,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:55:36,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:55:36,671 INFO L87 Difference]: Start difference. First operand 4284 states and 6228 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 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-21 10:55:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:43,270 INFO L93 Difference]: Finished difference Result 14467 states and 22170 transitions. [2022-07-21 10:55:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:55:43,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 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 41 [2022-07-21 10:55:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:43,321 INFO L225 Difference]: With dead ends: 14467 [2022-07-21 10:55:43,321 INFO L226 Difference]: Without dead ends: 10197 [2022-07-21 10:55:43,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:55:43,348 INFO L413 NwaCegarLoop]: 1419 mSDtfsCounter, 3162 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 1605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3324 SdHoareTripleChecker+Valid, 3634 SdHoareTripleChecker+Invalid, 3815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1605 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:43,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3324 Valid, 3634 Invalid, 3815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1605 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 10:55:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10197 states. [2022-07-21 10:55:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10197 to 8775. [2022-07-21 10:55:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8775 states, 6431 states have (on average 1.3276317835484372) internal successors, (8538), 6491 states have internal predecessors, (8538), 1726 states have call successors, (1726), 435 states have call predecessors, (1726), 617 states have return successors, (2913), 1880 states have call predecessors, (2913), 1719 states have call successors, (2913) [2022-07-21 10:55:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 13177 transitions. [2022-07-21 10:55:43,888 INFO L78 Accepts]: Start accepts. Automaton has 8775 states and 13177 transitions. Word has length 41 [2022-07-21 10:55:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:43,890 INFO L495 AbstractCegarLoop]: Abstraction has 8775 states and 13177 transitions. [2022-07-21 10:55:43,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 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-21 10:55:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 8775 states and 13177 transitions. [2022-07-21 10:55:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 10:55:43,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:43,893 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, 1, 1, 1, 1, 1, 1] [2022-07-21 10:55:43,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 10:55:43,894 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2024702322, now seen corresponding path program 1 times [2022-07-21 10:55:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:43,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376013420] [2022-07-21 10:55:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:44,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:44,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:55:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:55:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:44,079 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-21 10:55:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:44,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376013420] [2022-07-21 10:55:44,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376013420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:55:44,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:55:44,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:55:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725252374] [2022-07-21 10:55:44,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:55:44,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:55:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:55:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:55:44,082 INFO L87 Difference]: Start difference. First operand 8775 states and 13177 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 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-21 10:55:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:48,710 INFO L93 Difference]: Finished difference Result 10165 states and 15561 transitions. [2022-07-21 10:55:48,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:55:48,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 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 42 [2022-07-21 10:55:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:48,754 INFO L225 Difference]: With dead ends: 10165 [2022-07-21 10:55:48,754 INFO L226 Difference]: Without dead ends: 10153 [2022-07-21 10:55:48,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:55:48,762 INFO L413 NwaCegarLoop]: 1212 mSDtfsCounter, 2190 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 992 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 992 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:48,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 2236 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [992 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-21 10:55:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2022-07-21 10:55:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 8765. [2022-07-21 10:55:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8765 states, 6422 states have (on average 1.3274680784802242) internal successors, (8525), 6481 states have internal predecessors, (8525), 1725 states have call successors, (1725), 435 states have call predecessors, (1725), 617 states have return successors, (2913), 1880 states have call predecessors, (2913), 1719 states have call successors, (2913) [2022-07-21 10:55:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 13163 transitions. [2022-07-21 10:55:49,285 INFO L78 Accepts]: Start accepts. Automaton has 8765 states and 13163 transitions. Word has length 42 [2022-07-21 10:55:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:49,285 INFO L495 AbstractCegarLoop]: Abstraction has 8765 states and 13163 transitions. [2022-07-21 10:55:49,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 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-21 10:55:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 8765 states and 13163 transitions. [2022-07-21 10:55:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-21 10:55:49,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:49,292 INFO L195 NwaCegarLoop]: trace histogram [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-21 10:55:49,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 10:55:49,293 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash -8229079, now seen corresponding path program 1 times [2022-07-21 10:55:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:49,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106566288] [2022-07-21 10:55:49,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:55:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:55:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:55:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 10:55:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 10:55:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:55:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 10:55:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:55:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 10:55:49,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:49,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106566288] [2022-07-21 10:55:49,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106566288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:55:49,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:55:49,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 10:55:49,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899303482] [2022-07-21 10:55:49,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:55:49,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 10:55:49,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:49,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 10:55:49,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:55:49,498 INFO L87 Difference]: Start difference. First operand 8765 states and 13163 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 10:55:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:55,024 INFO L93 Difference]: Finished difference Result 21687 states and 33736 transitions. [2022-07-21 10:55:55,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 10:55:55,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-07-21 10:55:55,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:55,094 INFO L225 Difference]: With dead ends: 21687 [2022-07-21 10:55:55,094 INFO L226 Difference]: Without dead ends: 12936 [2022-07-21 10:55:55,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-21 10:55:55,142 INFO L413 NwaCegarLoop]: 1279 mSDtfsCounter, 2727 mSDsluCounter, 2902 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 1838 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 4181 SdHoareTripleChecker+Invalid, 4293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1838 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:55,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2851 Valid, 4181 Invalid, 4293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1838 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-21 10:55:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2022-07-21 10:55:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 10735. [2022-07-21 10:55:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10735 states, 7852 states have (on average 1.3136780438104942) internal successors, (10315), 7905 states have internal predecessors, (10315), 2063 states have call successors, (2063), 437 states have call predecessors, (2063), 819 states have return successors, (4329), 2428 states have call predecessors, (4329), 2057 states have call successors, (4329) [2022-07-21 10:55:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10735 states to 10735 states and 16707 transitions. [2022-07-21 10:55:55,860 INFO L78 Accepts]: Start accepts. Automaton has 10735 states and 16707 transitions. Word has length 88 [2022-07-21 10:55:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:55,860 INFO L495 AbstractCegarLoop]: Abstraction has 10735 states and 16707 transitions. [2022-07-21 10:55:55,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 10:55:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 10735 states and 16707 transitions. [2022-07-21 10:55:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-21 10:55:55,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:55,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:55:55,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 10:55:55,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash 810961881, now seen corresponding path program 1 times [2022-07-21 10:55:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:55,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787824395] [2022-07-21 10:55:55,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:55:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:55:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 10:55:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 10:55:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 10:55:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 10:55:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:55:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 10:55:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:55:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 10:55:56,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:56,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787824395] [2022-07-21 10:55:56,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787824395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:55:56,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:55:56,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 10:55:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906988040] [2022-07-21 10:55:56,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:55:56,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 10:55:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:56,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 10:55:56,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:55:56,183 INFO L87 Difference]: Start difference. First operand 10735 states and 16707 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 10:56:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:56:06,913 INFO L93 Difference]: Finished difference Result 36184 states and 57105 transitions. [2022-07-21 10:56:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 10:56:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2022-07-21 10:56:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:56:07,054 INFO L225 Difference]: With dead ends: 36184 [2022-07-21 10:56:07,055 INFO L226 Difference]: Without dead ends: 25471 [2022-07-21 10:56:07,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-07-21 10:56:07,108 INFO L413 NwaCegarLoop]: 2153 mSDtfsCounter, 4300 mSDsluCounter, 4152 mSDsCounter, 0 mSdLazyCounter, 4112 mSolverCounterSat, 3466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 6305 SdHoareTripleChecker+Invalid, 7578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3466 IncrementalHoareTripleChecker+Valid, 4112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-21 10:56:07,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 6305 Invalid, 7578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3466 Valid, 4112 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-07-21 10:56:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25471 states. [2022-07-21 10:56:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25471 to 21097. [2022-07-21 10:56:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21097 states, 15412 states have (on average 1.3101479366727224) internal successors, (20192), 15515 states have internal predecessors, (20192), 4053 states have call successors, (4053), 865 states have call predecessors, (4053), 1631 states have return successors, (8423), 4788 states have call predecessors, (8423), 4047 states have call successors, (8423) [2022-07-21 10:56:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21097 states to 21097 states and 32668 transitions. [2022-07-21 10:56:08,540 INFO L78 Accepts]: Start accepts. Automaton has 21097 states and 32668 transitions. Word has length 112 [2022-07-21 10:56:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:56:08,540 INFO L495 AbstractCegarLoop]: Abstraction has 21097 states and 32668 transitions. [2022-07-21 10:56:08,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 10:56:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 21097 states and 32668 transitions. [2022-07-21 10:56:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-21 10:56:08,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:56:08,549 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:56:08,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 10:56:08,550 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:56:08,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:56:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash 635108726, now seen corresponding path program 1 times [2022-07-21 10:56:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:56:08,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861536685] [2022-07-21 10:56:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:56:08,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:56:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:56:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:56:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:56:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 10:56:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:56:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 10:56:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 10:56:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 10:56:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 10:56:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 10:56:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:56:08,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861536685] [2022-07-21 10:56:08,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861536685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:56:08,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:56:08,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 10:56:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757870708] [2022-07-21 10:56:08,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:56:08,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 10:56:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:56:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 10:56:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:56:08,859 INFO L87 Difference]: Start difference. First operand 21097 states and 32668 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 10:56:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:56:24,489 INFO L93 Difference]: Finished difference Result 61683 states and 97245 transitions. [2022-07-21 10:56:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 10:56:24,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2022-07-21 10:56:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:56:24,816 INFO L225 Difference]: With dead ends: 61683 [2022-07-21 10:56:24,817 INFO L226 Difference]: Without dead ends: 40608 [2022-07-21 10:56:24,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-07-21 10:56:24,897 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 3564 mSDsluCounter, 5198 mSDsCounter, 0 mSdLazyCounter, 5660 mSolverCounterSat, 2385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3776 SdHoareTripleChecker+Valid, 7437 SdHoareTripleChecker+Invalid, 8045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2385 IncrementalHoareTripleChecker+Valid, 5660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-07-21 10:56:24,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3776 Valid, 7437 Invalid, 8045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2385 Valid, 5660 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2022-07-21 10:56:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40608 states. [2022-07-21 10:56:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40608 to 31579. [2022-07-21 10:56:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31579 states, 23056 states have (on average 1.3092036780013878) internal successors, (30185), 23221 states have internal predecessors, (30185), 6055 states have call successors, (6055), 1293 states have call predecessors, (6055), 2467 states have return successors, (12553), 7172 states have call predecessors, (12553), 6049 states have call successors, (12553) [2022-07-21 10:56:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31579 states to 31579 states and 48793 transitions. [2022-07-21 10:56:26,978 INFO L78 Accepts]: Start accepts. Automaton has 31579 states and 48793 transitions. Word has length 132 [2022-07-21 10:56:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:56:26,979 INFO L495 AbstractCegarLoop]: Abstraction has 31579 states and 48793 transitions. [2022-07-21 10:56:26,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 10:56:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 31579 states and 48793 transitions. [2022-07-21 10:56:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-21 10:56:26,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:56:26,988 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:56:26,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 10:56:26,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:56:26,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:56:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1913868486, now seen corresponding path program 1 times [2022-07-21 10:56:26,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:56:26,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42576870] [2022-07-21 10:56:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:56:26,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:56:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:56:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:56:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:56:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 10:56:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:56:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 10:56:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 10:56:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:56:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:56:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 10:56:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 10:56:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 10:56:27,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:56:27,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42576870] [2022-07-21 10:56:27,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42576870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:56:27,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:56:27,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 10:56:27,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031186534] [2022-07-21 10:56:27,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:56:27,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 10:56:27,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:56:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 10:56:27,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 10:56:27,359 INFO L87 Difference]: Start difference. First operand 31579 states and 48793 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 10:56:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:56:55,610 INFO L93 Difference]: Finished difference Result 115438 states and 201604 transitions. [2022-07-21 10:56:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-21 10:56:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2022-07-21 10:56:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:56:56,157 INFO L225 Difference]: With dead ends: 115438 [2022-07-21 10:56:56,157 INFO L226 Difference]: Without dead ends: 83881 [2022-07-21 10:56:56,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2022-07-21 10:56:56,379 INFO L413 NwaCegarLoop]: 2452 mSDtfsCounter, 8872 mSDsluCounter, 10472 mSDsCounter, 0 mSdLazyCounter, 13434 mSolverCounterSat, 9798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9083 SdHoareTripleChecker+Valid, 12924 SdHoareTripleChecker+Invalid, 23232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9798 IncrementalHoareTripleChecker+Valid, 13434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:56:56,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9083 Valid, 12924 Invalid, 23232 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9798 Valid, 13434 Invalid, 0 Unknown, 0 Unchecked, 23.0s Time] [2022-07-21 10:56:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83881 states. [2022-07-21 10:56:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83881 to 34437. [2022-07-21 10:56:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34437 states, 24964 states have (on average 1.3055199487261657) internal successors, (32591), 25039 states have internal predecessors, (32591), 6865 states have call successors, (6865), 1293 states have call predecessors, (6865), 2607 states have return successors, (14493), 8224 states have call predecessors, (14493), 6859 states have call successors, (14493) [2022-07-21 10:56:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34437 states to 34437 states and 53949 transitions. [2022-07-21 10:56:59,537 INFO L78 Accepts]: Start accepts. Automaton has 34437 states and 53949 transitions. Word has length 139 [2022-07-21 10:56:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:56:59,538 INFO L495 AbstractCegarLoop]: Abstraction has 34437 states and 53949 transitions. [2022-07-21 10:56:59,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 10:56:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 34437 states and 53949 transitions. [2022-07-21 10:56:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-21 10:56:59,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:56:59,545 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:56:59,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 10:56:59,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:56:59,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:56:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash -100167631, now seen corresponding path program 1 times [2022-07-21 10:56:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:56:59,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157836692] [2022-07-21 10:56:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:56:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:56:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:56:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:56:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:56:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 10:56:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:56:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 10:56:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 10:56:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 10:56:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 10:56:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 10:56:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 10:56:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:56:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:56:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 10:56:59,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:56:59,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157836692] [2022-07-21 10:56:59,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157836692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:56:59,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:56:59,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 10:56:59,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406205569] [2022-07-21 10:56:59,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:56:59,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 10:56:59,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:56:59,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 10:56:59,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 10:56:59,961 INFO L87 Difference]: Start difference. First operand 34437 states and 53949 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 10:57:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:57:30,495 INFO L93 Difference]: Finished difference Result 118352 states and 206832 transitions. [2022-07-21 10:57:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-21 10:57:30,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2022-07-21 10:57:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:57:30,963 INFO L225 Difference]: With dead ends: 118352 [2022-07-21 10:57:30,963 INFO L226 Difference]: Without dead ends: 83937 [2022-07-21 10:57:31,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2022-07-21 10:57:31,116 INFO L413 NwaCegarLoop]: 2453 mSDtfsCounter, 8591 mSDsluCounter, 10663 mSDsCounter, 0 mSdLazyCounter, 13081 mSolverCounterSat, 9510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8800 SdHoareTripleChecker+Valid, 13116 SdHoareTripleChecker+Invalid, 22591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9510 IncrementalHoareTripleChecker+Valid, 13081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2022-07-21 10:57:31,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8800 Valid, 13116 Invalid, 22591 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9510 Valid, 13081 Invalid, 0 Unknown, 0 Unchecked, 24.2s Time] [2022-07-21 10:57:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83937 states. [2022-07-21 10:57:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83937 to 34437. [2022-07-21 10:57:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34437 states, 24964 states have (on average 1.3055199487261657) internal successors, (32591), 25039 states have internal predecessors, (32591), 6865 states have call successors, (6865), 1293 states have call predecessors, (6865), 2607 states have return successors, (14493), 8224 states have call predecessors, (14493), 6859 states have call successors, (14493) [2022-07-21 10:57:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34437 states to 34437 states and 53949 transitions. [2022-07-21 10:57:34,817 INFO L78 Accepts]: Start accepts. Automaton has 34437 states and 53949 transitions. Word has length 143 [2022-07-21 10:57:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:57:34,817 INFO L495 AbstractCegarLoop]: Abstraction has 34437 states and 53949 transitions. [2022-07-21 10:57:34,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 10:57:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34437 states and 53949 transitions. [2022-07-21 10:57:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 10:57:34,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:57:34,823 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:57:34,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 10:57:34,824 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:57:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:57:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1956184300, now seen corresponding path program 1 times [2022-07-21 10:57:34,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:57:34,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579200110] [2022-07-21 10:57:34,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:57:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:57:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:57:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:57:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:57:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 10:57:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:57:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 10:57:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 10:57:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:57:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:57:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:57:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 10:57:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:57:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 10:57:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 10:57:35,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:57:35,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579200110] [2022-07-21 10:57:35,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579200110] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:57:35,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229968345] [2022-07-21 10:57:35,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:57:35,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 10:57:35,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:57:35,243 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-21 10:57:35,276 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-21 10:57:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:36,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 3514 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 10:57:36,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 10:57:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 10:57:36,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 10:57:36,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229968345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:57:36,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 10:57:36,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-21 10:57:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839876073] [2022-07-21 10:57:36,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:57:36,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 10:57:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:57:36,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 10:57:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 10:57:36,211 INFO L87 Difference]: Start difference. First operand 34437 states and 53949 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 10:57:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:57:39,759 INFO L93 Difference]: Finished difference Result 81119 states and 127134 transitions. [2022-07-21 10:57:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 10:57:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 169 [2022-07-21 10:57:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:57:39,993 INFO L225 Difference]: With dead ends: 81119 [2022-07-21 10:57:39,993 INFO L226 Difference]: Without dead ends: 46704 [2022-07-21 10:57:40,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-07-21 10:57:40,089 INFO L413 NwaCegarLoop]: 2587 mSDtfsCounter, 1346 mSDsluCounter, 8869 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 11456 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 10:57:40,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 11456 Invalid, 157 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 10:57:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46704 states. [2022-07-21 10:57:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46704 to 34505. [2022-07-21 10:57:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34505 states, 25004 states have (on average 1.3050311950087985) internal successors, (32631), 25083 states have internal predecessors, (32631), 6889 states have call successors, (6889), 1293 states have call predecessors, (6889), 2611 states have return successors, (14533), 8248 states have call predecessors, (14533), 6883 states have call successors, (14533) [2022-07-21 10:57:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34505 states to 34505 states and 54053 transitions. [2022-07-21 10:57:42,627 INFO L78 Accepts]: Start accepts. Automaton has 34505 states and 54053 transitions. Word has length 169 [2022-07-21 10:57:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:57:42,627 INFO L495 AbstractCegarLoop]: Abstraction has 34505 states and 54053 transitions. [2022-07-21 10:57:42,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 10:57:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34505 states and 54053 transitions. [2022-07-21 10:57:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 10:57:42,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:57:42,631 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:57:42,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 10:57:42,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 10:57:42,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:57:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:57:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1327665746, now seen corresponding path program 1 times [2022-07-21 10:57:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:57:42,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729456828] [2022-07-21 10:57:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:57:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:57:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:57:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:57:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:57:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 10:57:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:57:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 10:57:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 10:57:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:57:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:57:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:57:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:57:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 10:57:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:57:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 10:57:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-21 10:57:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:57:43,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729456828] [2022-07-21 10:57:43,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729456828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:57:43,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570910148] [2022-07-21 10:57:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:57:43,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 10:57:43,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:57:43,459 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-21 10:57:43,460 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-21 10:57:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:57:44,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 3509 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-21 10:57:44,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 10:57:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-21 10:57:44,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 10:57:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-21 10:57:44,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570910148] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 10:57:44,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 10:57:44,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-07-21 10:57:44,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356964080] [2022-07-21 10:57:44,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 10:57:44,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 10:57:44,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:57:44,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 10:57:44,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-07-21 10:57:44,988 INFO L87 Difference]: Start difference. First operand 34505 states and 54053 transitions. Second operand has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 14 states have internal predecessors, (168), 4 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (36), 11 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-21 10:58:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:09,577 INFO L93 Difference]: Finished difference Result 82976 states and 142537 transitions. [2022-07-21 10:58:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 10:58:09,578 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 14 states have internal predecessors, (168), 4 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (36), 11 states have call predecessors, (36), 4 states have call successors, (36) Word has length 169 [2022-07-21 10:58:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:09,887 INFO L225 Difference]: With dead ends: 82976 [2022-07-21 10:58:09,887 INFO L226 Difference]: Without dead ends: 48445 [2022-07-21 10:58:10,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2022-07-21 10:58:10,063 INFO L413 NwaCegarLoop]: 1170 mSDtfsCounter, 1125 mSDsluCounter, 17459 mSDsCounter, 0 mSdLazyCounter, 11905 mSolverCounterSat, 610 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 18629 SdHoareTripleChecker+Invalid, 12515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 610 IncrementalHoareTripleChecker+Valid, 11905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:10,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 18629 Invalid, 12515 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [610 Valid, 11905 Invalid, 0 Unknown, 0 Unchecked, 20.4s Time] [2022-07-21 10:58:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48445 states. [2022-07-21 10:58:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48445 to 34841. [2022-07-21 10:58:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34841 states, 25244 states have (on average 1.3021311994929488) internal successors, (32871), 25323 states have internal predecessors, (32871), 6913 states have call successors, (6913), 1293 states have call predecessors, (6913), 2683 states have return successors, (14917), 8344 states have call predecessors, (14917), 6907 states have call successors, (14917) [2022-07-21 10:58:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34841 states to 34841 states and 54701 transitions. [2022-07-21 10:58:12,819 INFO L78 Accepts]: Start accepts. Automaton has 34841 states and 54701 transitions. Word has length 169 [2022-07-21 10:58:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:58:12,819 INFO L495 AbstractCegarLoop]: Abstraction has 34841 states and 54701 transitions. [2022-07-21 10:58:12,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.222222222222222) internal successors, (168), 14 states have internal predecessors, (168), 4 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (36), 11 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-21 10:58:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 34841 states and 54701 transitions. [2022-07-21 10:58:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-21 10:58:12,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:58:12,823 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:58:12,853 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-21 10:58:13,039 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,SelfDestructingSolverStorable13 [2022-07-21 10:58:13,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:58:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:58:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash -975854030, now seen corresponding path program 1 times [2022-07-21 10:58:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:58:13,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454813759] [2022-07-21 10:58:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:58:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:58:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:58:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:58:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 10:58:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:58:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 10:58:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:58:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:58:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:58:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 10:58:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 10:58:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 10:58:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-21 10:58:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:58:13,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454813759] [2022-07-21 10:58:13,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454813759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:58:13,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:58:13,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 10:58:13,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696273401] [2022-07-21 10:58:13,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:58:13,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 10:58:13,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:58:13,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 10:58:13,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-21 10:58:13,468 INFO L87 Difference]: Start difference. First operand 34841 states and 54701 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (20), 8 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 10:58:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:25,397 INFO L93 Difference]: Finished difference Result 83216 states and 142469 transitions. [2022-07-21 10:58:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 10:58:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (20), 8 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 181 [2022-07-21 10:58:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:25,633 INFO L225 Difference]: With dead ends: 83216 [2022-07-21 10:58:25,633 INFO L226 Difference]: Without dead ends: 48397 [2022-07-21 10:58:25,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-21 10:58:25,811 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1613 mSDsluCounter, 4745 mSDsCounter, 0 mSdLazyCounter, 3554 mSolverCounterSat, 1097 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 5919 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1097 IncrementalHoareTripleChecker+Valid, 3554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:25,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 5919 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1097 Valid, 3554 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-21 10:58:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48397 states. [2022-07-21 10:58:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48397 to 34889. [2022-07-21 10:58:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34889 states, 25292 states have (on average 1.301557804839475) internal successors, (32919), 25371 states have internal predecessors, (32919), 6913 states have call successors, (6913), 1293 states have call predecessors, (6913), 2683 states have return successors, (14917), 8344 states have call predecessors, (14917), 6907 states have call successors, (14917) [2022-07-21 10:58:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34889 states to 34889 states and 54749 transitions. [2022-07-21 10:58:28,384 INFO L78 Accepts]: Start accepts. Automaton has 34889 states and 54749 transitions. Word has length 181 [2022-07-21 10:58:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:58:28,384 INFO L495 AbstractCegarLoop]: Abstraction has 34889 states and 54749 transitions. [2022-07-21 10:58:28,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (20), 8 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 10:58:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 34889 states and 54749 transitions. [2022-07-21 10:58:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-21 10:58:28,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:58:28,387 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:58:28,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 10:58:28,388 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:58:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:58:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash -219059742, now seen corresponding path program 1 times [2022-07-21 10:58:28,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:58:28,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225306058] [2022-07-21 10:58:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:58:28,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:58:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 10:58:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:58:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 10:58:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:58:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:58:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:58:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 10:58:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 10:58:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:58:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:28,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:58:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 10:58:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 10:58:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:58:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 10:58:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:58:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-21 10:58:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:58:29,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225306058] [2022-07-21 10:58:29,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225306058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:58:29,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:58:29,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 10:58:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285343674] [2022-07-21 10:58:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:58:29,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 10:58:29,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:58:29,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 10:58:29,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-21 10:58:29,048 INFO L87 Difference]: Start difference. First operand 34889 states and 54749 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-21 10:58:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:58:40,327 INFO L93 Difference]: Finished difference Result 83252 states and 139593 transitions. [2022-07-21 10:58:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 10:58:40,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 4 states have internal predecessors, (115), 3 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 194 [2022-07-21 10:58:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:58:40,704 INFO L225 Difference]: With dead ends: 83252 [2022-07-21 10:58:40,704 INFO L226 Difference]: Without dead ends: 48385 [2022-07-21 10:58:40,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-07-21 10:58:40,820 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 1599 mSDsluCounter, 4074 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 1010 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 5238 SdHoareTripleChecker+Invalid, 4106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1010 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-21 10:58:40,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 5238 Invalid, 4106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1010 Valid, 3096 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-07-21 10:58:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48385 states. [2022-07-21 10:58:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48385 to 35009. [2022-07-21 10:58:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35009 states, 25388 states have (on average 1.301362848589885) internal successors, (33039), 25443 states have internal predecessors, (33039), 6937 states have call successors, (6937), 1293 states have call predecessors, (6937), 2683 states have return successors, (14941), 8392 states have call predecessors, (14941), 6931 states have call successors, (14941)