./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.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 0b2aee7f7e67804021e49e5736bb0f9c1b2e215c216274214a3b77fa62ce19be --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 23:43:21,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 23:43:21,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 23:43:21,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 23:43:21,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 23:43:21,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 23:43:21,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 23:43:21,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 23:43:21,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 23:43:21,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 23:43:21,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 23:43:21,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 23:43:21,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 23:43:21,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 23:43:21,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 23:43:21,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 23:43:21,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 23:43:21,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 23:43:21,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 23:43:21,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 23:43:21,591 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 23:43:21,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 23:43:21,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 23:43:21,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 23:43:21,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 23:43:21,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 23:43:21,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 23:43:21,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 23:43:21,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 23:43:21,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 23:43:21,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 23:43:21,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 23:43:21,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 23:43:21,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 23:43:21,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 23:43:21,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 23:43:21,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 23:43:21,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 23:43:21,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 23:43:21,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 23:43:21,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 23:43:21,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 23:43:21,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 23:43:21,633 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 23:43:21,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 23:43:21,633 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 23:43:21,634 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 23:43:21,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 23:43:21,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 23:43:21,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 23:43:21,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 23:43:21,637 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 23:43:21,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 23:43:21,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 23:43:21,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 23:43:21,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 23:43:21,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 23:43:21,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 23:43:21,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 23:43:21,639 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 23:43:21,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 23:43:21,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 23:43:21,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 23:43:21,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 23:43:21,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:43:21,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 23:43:21,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 23:43:21,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 23:43:21,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 23:43:21,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 23:43:21,648 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 23:43:21,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 23:43:21,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 23:43:21,649 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 -> 0b2aee7f7e67804021e49e5736bb0f9c1b2e215c216274214a3b77fa62ce19be [2022-07-22 23:43:21,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 23:43:21,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 23:43:21,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 23:43:21,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 23:43:21,866 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 23:43:21,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-22 23:43:21,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97704edb2/5a3b665e152e4e4eb878d760e3316636/FLAGe236840f7 [2022-07-22 23:43:22,557 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 23:43:22,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-22 23:43:22,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97704edb2/5a3b665e152e4e4eb878d760e3316636/FLAGe236840f7 [2022-07-22 23:43:22,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97704edb2/5a3b665e152e4e4eb878d760e3316636 [2022-07-22 23:43:22,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 23:43:22,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 23:43:22,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 23:43:22,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 23:43:22,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 23:43:22,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:43:22" (1/1) ... [2022-07-22 23:43:22,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ecb4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:22, skipping insertion in model container [2022-07-22 23:43:22,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:43:22" (1/1) ... [2022-07-22 23:43:22,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 23:43:23,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 23:43:23,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[182154,182167] [2022-07-22 23:43:24,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:43:24,304 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 23:43:24,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[182154,182167] [2022-07-22 23:43:24,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:43:24,666 INFO L208 MainTranslator]: Completed translation [2022-07-22 23:43:24,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24 WrapperNode [2022-07-22 23:43:24,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 23:43:24,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 23:43:24,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 23:43:24,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 23:43:24,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:24,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:24,845 INFO L137 Inliner]: procedures = 174, calls = 1340, calls flagged for inlining = 82, calls inlined = 66, statements flattened = 2613 [2022-07-22 23:43:24,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 23:43:24,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 23:43:24,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 23:43:24,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 23:43:24,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:24,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:24,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:24,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:24,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:25,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:25,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:25,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 23:43:25,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 23:43:25,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 23:43:25,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 23:43:25,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:25,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:43:25,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:43:25,102 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-22 23:43:25,116 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-22 23:43:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_reset_device [2022-07-22 23:43:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_reset_device [2022-07-22 23:43:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_resume [2022-07-22 23:43:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_resume [2022-07-22 23:43:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-22 23:43:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-22 23:43:25,144 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-22 23:43:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_12 [2022-07-22 23:43:25,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_12 [2022-07-22 23:43:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 23:43:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 23:43:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-22 23:43:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-22 23:43:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 23:43:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-22 23:43:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-22 23:43:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-22 23:43:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-22 23:43:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 23:43:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 23:43:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-22 23:43:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-22 23:43:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 23:43:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 23:43:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-22 23:43:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-22 23:43:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb_fwload [2022-07-22 23:43:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb_fwload [2022-07-22 23:43:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-22 23:43:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-22 23:43:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_1 [2022-07-22 23:43:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_1 [2022-07-22 23:43:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_submit_rx_urb [2022-07-22 23:43:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_submit_rx_urb [2022-07-22 23:43:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_receive_fwload [2022-07-22 23:43:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_receive_fwload [2022-07-22 23:43:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-22 23:43:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-22 23:43:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_send_fw_pkt [2022-07-22 23:43:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_send_fw_pkt [2022-07-22 23:43:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure __if_usb_submit_rx_urb [2022-07-22 23:43:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __if_usb_submit_rx_urb [2022-07-22 23:43:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 23:43:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-22 23:43:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-22 23:43:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_free [2022-07-22 23:43:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_free [2022-07-22 23:43:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-22 23:43:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-22 23:43:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-22 23:43:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-22 23:43:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 23:43:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 23:43:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 23:43:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-22 23:43:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-22 23:43:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_disconnect [2022-07-22 23:43:25,153 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_disconnect [2022-07-22 23:43:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure usb_tx_block [2022-07-22 23:43:25,154 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_tx_block [2022-07-22 23:43:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 23:43:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_1 [2022-07-22 23:43:25,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_1 [2022-07-22 23:43:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_9 [2022-07-22 23:43:25,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_9 [2022-07-22 23:43:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-22 23:43:25,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-22 23:43:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 23:43:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 23:43:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-22 23:43:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 23:43:25,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 23:43:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_8 [2022-07-22 23:43:25,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_8 [2022-07-22 23:43:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-22 23:43:25,156 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-22 23:43:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 23:43:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_13 [2022-07-22 23:43:25,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_13 [2022-07-22 23:43:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-22 23:43:25,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-22 23:43:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-22 23:43:25,157 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-22 23:43:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_15 [2022-07-22 23:43:25,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_15 [2022-07-22 23:43:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 23:43:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 23:43:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-07-22 23:43:25,158 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-07-22 23:43:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure lbs_remove_card [2022-07-22 23:43:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure lbs_remove_card [2022-07-22 23:43:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-22 23:43:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-22 23:43:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-22 23:43:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-22 23:43:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure if_usb_receive [2022-07-22 23:43:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure if_usb_receive [2022-07-22 23:43:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-22 23:43:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-22 23:43:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 23:43:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-22 23:43:25,161 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-22 23:43:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-22 23:43:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-22 23:43:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-22 23:43:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 23:43:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 23:43:25,736 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 23:43:25,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 23:43:25,972 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-22 23:43:26,688 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-22 23:43:27,482 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 23:43:27,500 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 23:43:27,500 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 23:43:27,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:43:27 BoogieIcfgContainer [2022-07-22 23:43:27,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 23:43:27,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 23:43:27,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 23:43:27,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 23:43:27,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:43:22" (1/3) ... [2022-07-22 23:43:27,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5775c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:43:27, skipping insertion in model container [2022-07-22 23:43:27,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24" (2/3) ... [2022-07-22 23:43:27,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5775c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:43:27, skipping insertion in model container [2022-07-22 23:43:27,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:43:27" (3/3) ... [2022-07-22 23:43:27,517 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2022-07-22 23:43:27,541 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 23:43:27,541 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 23:43:27,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 23:43:27,628 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@698572cd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70b1755c [2022-07-22 23:43:27,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 23:43:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 826 states, 603 states have (on average 1.3747927031509122) internal successors, (829), 633 states have internal predecessors, (829), 178 states have call successors, (178), 45 states have call predecessors, (178), 43 states have return successors, (172), 166 states have call predecessors, (172), 172 states have call successors, (172) [2022-07-22 23:43:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 23:43:27,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:27,644 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, 1] [2022-07-22 23:43:27,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 527149613, now seen corresponding path program 1 times [2022-07-22 23:43:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:27,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064731393] [2022-07-22 23:43:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:28,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:28,218 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-22 23:43:28,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:28,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064731393] [2022-07-22 23:43:28,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064731393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:28,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:28,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320514614] [2022-07-22 23:43:28,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:28,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:28,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:28,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:28,260 INFO L87 Difference]: Start difference. First operand has 826 states, 603 states have (on average 1.3747927031509122) internal successors, (829), 633 states have internal predecessors, (829), 178 states have call successors, (178), 45 states have call predecessors, (178), 43 states have return successors, (172), 166 states have call predecessors, (172), 172 states have call successors, (172) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 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-22 23:43:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:31,624 INFO L93 Difference]: Finished difference Result 2773 states and 4101 transitions. [2022-07-22 23:43:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:43:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 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 29 [2022-07-22 23:43:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:31,656 INFO L225 Difference]: With dead ends: 2773 [2022-07-22 23:43:31,656 INFO L226 Difference]: Without dead ends: 1924 [2022-07-22 23:43:31,667 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-22 23:43:31,670 INFO L413 NwaCegarLoop]: 1257 mSDtfsCounter, 2444 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 1173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2557 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 2744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1173 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:31,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2557 Valid, 3111 Invalid, 2744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1173 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-22 23:43:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2022-07-22 23:43:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1585. [2022-07-22 23:43:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1165 states have (on average 1.36137339055794) internal successors, (1586), 1205 states have internal predecessors, (1586), 336 states have call successors, (336), 84 states have call predecessors, (336), 83 states have return successors, (331), 319 states have call predecessors, (331), 331 states have call successors, (331) [2022-07-22 23:43:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2253 transitions. [2022-07-22 23:43:31,888 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2253 transitions. Word has length 29 [2022-07-22 23:43:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:31,888 INFO L495 AbstractCegarLoop]: Abstraction has 1585 states and 2253 transitions. [2022-07-22 23:43:31,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 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-22 23:43:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2253 transitions. [2022-07-22 23:43:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 23:43:31,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:31,897 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-22 23:43:31,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 23:43:31,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:31,899 INFO L85 PathProgramCache]: Analyzing trace with hash 195057076, now seen corresponding path program 1 times [2022-07-22 23:43:31,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:31,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589863676] [2022-07-22 23:43:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:31,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:43:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:32,066 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-22 23:43:32,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:32,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589863676] [2022-07-22 23:43:32,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589863676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:32,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:32,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863676881] [2022-07-22 23:43:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:32,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:32,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:32,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:32,070 INFO L87 Difference]: Start difference. First operand 1585 states and 2253 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-22 23:43:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:33,634 INFO L93 Difference]: Finished difference Result 1950 states and 2809 transitions. [2022-07-22 23:43:33,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 23:43:33,635 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-22 23:43:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:33,648 INFO L225 Difference]: With dead ends: 1950 [2022-07-22 23:43:33,648 INFO L226 Difference]: Without dead ends: 1937 [2022-07-22 23:43:33,652 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-22 23:43:33,654 INFO L413 NwaCegarLoop]: 1031 mSDtfsCounter, 1800 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:33,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 1935 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-22 23:43:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2022-07-22 23:43:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1585. [2022-07-22 23:43:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1165 states have (on average 1.3605150214592274) internal successors, (1585), 1205 states have internal predecessors, (1585), 336 states have call successors, (336), 84 states have call predecessors, (336), 83 states have return successors, (331), 319 states have call predecessors, (331), 331 states have call successors, (331) [2022-07-22 23:43:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2252 transitions. [2022-07-22 23:43:33,724 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2252 transitions. Word has length 39 [2022-07-22 23:43:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:33,724 INFO L495 AbstractCegarLoop]: Abstraction has 1585 states and 2252 transitions. [2022-07-22 23:43:33,725 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-22 23:43:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2252 transitions. [2022-07-22 23:43:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 23:43:33,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:33,726 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-22 23:43:33,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 23:43:33,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash 252315378, now seen corresponding path program 1 times [2022-07-22 23:43:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:33,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838640257] [2022-07-22 23:43:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:33,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:33,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:33,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:43:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:33,957 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-22 23:43:33,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:33,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838640257] [2022-07-22 23:43:33,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838640257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:33,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:33,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:33,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642188266] [2022-07-22 23:43:33,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:33,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:33,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:33,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:33,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:33,965 INFO L87 Difference]: Start difference. First operand 1585 states and 2252 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-22 23:43:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:36,942 INFO L93 Difference]: Finished difference Result 5389 states and 7961 transitions. [2022-07-22 23:43:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:43:36,943 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-22 23:43:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:36,991 INFO L225 Difference]: With dead ends: 5389 [2022-07-22 23:43:36,993 INFO L226 Difference]: Without dead ends: 3823 [2022-07-22 23:43:37,001 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-22 23:43:37,007 INFO L413 NwaCegarLoop]: 1237 mSDtfsCounter, 2525 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 1179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1179 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:37,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 3050 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1179 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-22 23:43:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2022-07-22 23:43:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3298. [2022-07-22 23:43:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 2431 states have (on average 1.3562320032908268) internal successors, (3297), 2507 states have internal predecessors, (3297), 678 states have call successors, (678), 165 states have call predecessors, (678), 188 states have return successors, (793), 669 states have call predecessors, (793), 673 states have call successors, (793) [2022-07-22 23:43:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 4768 transitions. [2022-07-22 23:43:37,183 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 4768 transitions. Word has length 39 [2022-07-22 23:43:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:37,183 INFO L495 AbstractCegarLoop]: Abstraction has 3298 states and 4768 transitions. [2022-07-22 23:43:37,184 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-22 23:43:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 4768 transitions. [2022-07-22 23:43:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 23:43:37,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:37,186 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-22 23:43:37,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 23:43:37,186 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash -768568990, now seen corresponding path program 1 times [2022-07-22 23:43:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:37,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199952302] [2022-07-22 23:43:37,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:37,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:37,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:43:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:37,373 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-22 23:43:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:37,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199952302] [2022-07-22 23:43:37,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199952302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:37,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:37,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601220403] [2022-07-22 23:43:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:37,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:37,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:37,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:37,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:37,376 INFO L87 Difference]: Start difference. First operand 3298 states and 4768 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-22 23:43:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:40,360 INFO L93 Difference]: Finished difference Result 10872 states and 16391 transitions. [2022-07-22 23:43:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:43:40,361 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-22 23:43:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:40,408 INFO L225 Difference]: With dead ends: 10872 [2022-07-22 23:43:40,409 INFO L226 Difference]: Without dead ends: 7593 [2022-07-22 23:43:40,427 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-22 23:43:40,428 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 2545 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 1203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1203 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:40,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2648 Valid, 2917 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1203 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-22 23:43:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7593 states. [2022-07-22 23:43:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7593 to 6717. [2022-07-22 23:43:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6717 states, 4956 states have (on average 1.3520984665052462) internal successors, (6701), 5104 states have internal predecessors, (6701), 1362 states have call successors, (1362), 327 states have call predecessors, (1362), 398 states have return successors, (1817), 1369 states have call predecessors, (1817), 1357 states have call successors, (1817) [2022-07-22 23:43:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6717 states to 6717 states and 9880 transitions. [2022-07-22 23:43:40,763 INFO L78 Accepts]: Start accepts. Automaton has 6717 states and 9880 transitions. Word has length 40 [2022-07-22 23:43:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:40,766 INFO L495 AbstractCegarLoop]: Abstraction has 6717 states and 9880 transitions. [2022-07-22 23:43:40,766 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-22 23:43:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 6717 states and 9880 transitions. [2022-07-22 23:43:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 23:43:40,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:40,768 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-22 23:43:40,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 23:43:40,768 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:40,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1943758837, now seen corresponding path program 1 times [2022-07-22 23:43:40,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:40,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924542536] [2022-07-22 23:43:40,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:40,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:43:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:40,966 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-22 23:43:40,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:40,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924542536] [2022-07-22 23:43:40,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924542536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:40,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:40,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:40,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155729729] [2022-07-22 23:43:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:40,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:40,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:40,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:40,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:40,969 INFO L87 Difference]: Start difference. First operand 6717 states and 9880 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-22 23:43:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:43,490 INFO L93 Difference]: Finished difference Result 7591 states and 11290 transitions. [2022-07-22 23:43:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:43:43,491 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-22 23:43:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:43,536 INFO L225 Difference]: With dead ends: 7591 [2022-07-22 23:43:43,536 INFO L226 Difference]: Without dead ends: 7588 [2022-07-22 23:43:43,542 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-22 23:43:43,542 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 2530 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 1196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2633 SdHoareTripleChecker+Valid, 2937 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1196 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:43,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2633 Valid, 2937 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1196 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 23:43:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7588 states. [2022-07-22 23:43:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7588 to 6718. [2022-07-22 23:43:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6718 states, 4957 states have (on average 1.3520274359491629) internal successors, (6702), 5105 states have internal predecessors, (6702), 1362 states have call successors, (1362), 327 states have call predecessors, (1362), 398 states have return successors, (1817), 1369 states have call predecessors, (1817), 1357 states have call successors, (1817) [2022-07-22 23:43:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 9881 transitions. [2022-07-22 23:43:43,937 INFO L78 Accepts]: Start accepts. Automaton has 6718 states and 9881 transitions. Word has length 41 [2022-07-22 23:43:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:43,938 INFO L495 AbstractCegarLoop]: Abstraction has 6718 states and 9881 transitions. [2022-07-22 23:43:43,938 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-22 23:43:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6718 states and 9881 transitions. [2022-07-22 23:43:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 23:43:43,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:43,940 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-22 23:43:43,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 23:43:43,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash 126580421, now seen corresponding path program 1 times [2022-07-22 23:43:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:43,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47505746] [2022-07-22 23:43:43,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:44,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:44,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:43:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:44,112 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-22 23:43:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:44,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47505746] [2022-07-22 23:43:44,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47505746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:44,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:44,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573836989] [2022-07-22 23:43:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:44,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:44,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:44,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:44,115 INFO L87 Difference]: Start difference. First operand 6718 states and 9881 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-22 23:43:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:45,511 INFO L93 Difference]: Finished difference Result 7587 states and 11286 transitions. [2022-07-22 23:43:45,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:43:45,512 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-22 23:43:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:45,545 INFO L225 Difference]: With dead ends: 7587 [2022-07-22 23:43:45,546 INFO L226 Difference]: Without dead ends: 7584 [2022-07-22 23:43:45,550 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-22 23:43:45,551 INFO L413 NwaCegarLoop]: 1016 mSDtfsCounter, 1781 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 700 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 700 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:45,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 1885 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [700 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-22 23:43:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7584 states. [2022-07-22 23:43:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7584 to 6717. [2022-07-22 23:43:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6717 states, 4957 states have (on average 1.3518257010288481) internal successors, (6701), 5104 states have internal predecessors, (6701), 1361 states have call successors, (1361), 327 states have call predecessors, (1361), 398 states have return successors, (1817), 1369 states have call predecessors, (1817), 1357 states have call successors, (1817) [2022-07-22 23:43:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6717 states to 6717 states and 9879 transitions. [2022-07-22 23:43:45,834 INFO L78 Accepts]: Start accepts. Automaton has 6717 states and 9879 transitions. Word has length 42 [2022-07-22 23:43:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:45,835 INFO L495 AbstractCegarLoop]: Abstraction has 6717 states and 9879 transitions. [2022-07-22 23:43:45,836 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-22 23:43:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6717 states and 9879 transitions. [2022-07-22 23:43:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 23:43:45,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:45,841 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, 1] [2022-07-22 23:43:45,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 23:43:45,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -371370760, now seen corresponding path program 1 times [2022-07-22 23:43:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:45,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306901122] [2022-07-22 23:43:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:43:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:46,016 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-22 23:43:46,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:46,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306901122] [2022-07-22 23:43:46,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306901122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:46,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:46,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425355975] [2022-07-22 23:43:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:46,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:46,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:46,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:46,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:46,019 INFO L87 Difference]: Start difference. First operand 6717 states and 9879 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 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-22 23:43:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:47,405 INFO L93 Difference]: Finished difference Result 7586 states and 11284 transitions. [2022-07-22 23:43:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:43:47,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 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 43 [2022-07-22 23:43:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:47,444 INFO L225 Difference]: With dead ends: 7586 [2022-07-22 23:43:47,445 INFO L226 Difference]: Without dead ends: 7574 [2022-07-22 23:43:47,450 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-22 23:43:47,451 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 1784 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:47,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 1870 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [702 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-22 23:43:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7574 states. [2022-07-22 23:43:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7574 to 6707. [2022-07-22 23:43:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6707 states, 4948 states have (on average 1.3516572352465643) internal successors, (6688), 5094 states have internal predecessors, (6688), 1360 states have call successors, (1360), 327 states have call predecessors, (1360), 398 states have return successors, (1817), 1369 states have call predecessors, (1817), 1357 states have call successors, (1817) [2022-07-22 23:43:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 9865 transitions. [2022-07-22 23:43:47,746 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 9865 transitions. Word has length 43 [2022-07-22 23:43:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:47,746 INFO L495 AbstractCegarLoop]: Abstraction has 6707 states and 9865 transitions. [2022-07-22 23:43:47,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 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-22 23:43:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 9865 transitions. [2022-07-22 23:43:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-22 23:43:47,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:47,758 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:43:47,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 23:43:47,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -134116982, now seen corresponding path program 1 times [2022-07-22 23:43:47,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:47,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511242385] [2022-07-22 23:43:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:47,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:47,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:47,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:47,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 23:43:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:47,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 23:43:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:47,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:47,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 23:43:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:47,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:47,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:43:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:48,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:43:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:48,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:43:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:48,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:43:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:48,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:43:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:48,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:43:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:48,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:43:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 23:43:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 23:43:48,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:48,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511242385] [2022-07-22 23:43:48,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511242385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:48,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:48,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 23:43:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491015805] [2022-07-22 23:43:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:48,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 23:43:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:48,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 23:43:48,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-22 23:43:48,106 INFO L87 Difference]: Start difference. First operand 6707 states and 9865 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 9 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:43:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:50,713 INFO L93 Difference]: Finished difference Result 16108 states and 23839 transitions. [2022-07-22 23:43:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 23:43:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 9 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2022-07-22 23:43:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:50,757 INFO L225 Difference]: With dead ends: 16108 [2022-07-22 23:43:50,758 INFO L226 Difference]: Without dead ends: 9420 [2022-07-22 23:43:50,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-07-22 23:43:50,791 INFO L413 NwaCegarLoop]: 1033 mSDtfsCounter, 2390 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 1485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2455 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1485 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:50,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2455 Valid, 3306 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1485 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 23:43:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9420 states. [2022-07-22 23:43:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9420 to 7983. [2022-07-22 23:43:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7983 states, 5905 states have (on average 1.3483488569009314) internal successors, (7962), 6083 states have internal predecessors, (7962), 1550 states have call successors, (1550), 352 states have call predecessors, (1550), 527 states have return successors, (2169), 1643 states have call predecessors, (2169), 1547 states have call successors, (2169) [2022-07-22 23:43:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 11681 transitions. [2022-07-22 23:43:51,185 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 11681 transitions. Word has length 143 [2022-07-22 23:43:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:51,185 INFO L495 AbstractCegarLoop]: Abstraction has 7983 states and 11681 transitions. [2022-07-22 23:43:51,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 9 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:43:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 11681 transitions. [2022-07-22 23:43:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-22 23:43:51,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:51,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:43:51,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 23:43:51,197 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1543029914, now seen corresponding path program 1 times [2022-07-22 23:43:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:51,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810128769] [2022-07-22 23:43:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:43:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 23:43:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:43:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:43:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:43:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:43:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:43:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:43:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:43:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:43:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:43:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 23:43:51,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:51,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810128769] [2022-07-22 23:43:51,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810128769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:43:51,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990694034] [2022-07-22 23:43:51,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:51,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:43:51,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:43:51,536 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-22 23:43:51,540 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-22 23:43:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:52,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 2718 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 23:43:52,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:43:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 23:43:52,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:43:52,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990694034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:52,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:43:52,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-07-22 23:43:52,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869704155] [2022-07-22 23:43:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:52,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-22 23:43:52,333 INFO L87 Difference]: Start difference. First operand 7983 states and 11681 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:43:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:53,146 INFO L93 Difference]: Finished difference Result 23983 states and 35141 transitions. [2022-07-22 23:43:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:43:53,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2022-07-22 23:43:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:53,207 INFO L225 Difference]: With dead ends: 23983 [2022-07-22 23:43:53,207 INFO L226 Difference]: Without dead ends: 16023 [2022-07-22 23:43:53,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-22 23:43:53,238 INFO L413 NwaCegarLoop]: 2213 mSDtfsCounter, 1438 mSDsluCounter, 5041 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 7254 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:53,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 7254 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:43:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16023 states. [2022-07-22 23:43:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16023 to 8031. [2022-07-22 23:43:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8031 states, 5937 states have (on average 1.346471281792151) internal successors, (7994), 6107 states have internal predecessors, (7994), 1566 states have call successors, (1566), 352 states have call predecessors, (1566), 527 states have return successors, (2203), 1659 states have call predecessors, (2203), 1563 states have call successors, (2203) [2022-07-22 23:43:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8031 states to 8031 states and 11763 transitions. [2022-07-22 23:43:53,820 INFO L78 Accepts]: Start accepts. Automaton has 8031 states and 11763 transitions. Word has length 152 [2022-07-22 23:43:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:53,820 INFO L495 AbstractCegarLoop]: Abstraction has 8031 states and 11763 transitions. [2022-07-22 23:43:53,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:43:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 8031 states and 11763 transitions. [2022-07-22 23:43:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-22 23:43:53,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:53,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:43:53,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 23:43:54,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:43:54,044 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:54,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:54,044 INFO L85 PathProgramCache]: Analyzing trace with hash 531912664, now seen corresponding path program 1 times [2022-07-22 23:43:54,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:54,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840669130] [2022-07-22 23:43:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:54,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:43:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 23:43:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:43:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:43:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:43:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:43:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:43:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:43:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:43:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:43:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:43:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 23:43:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840669130] [2022-07-22 23:43:54,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840669130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:43:54,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460139450] [2022-07-22 23:43:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:54,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:43:54,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:43:54,573 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-22 23:43:54,576 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-22 23:43:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:55,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 23:43:55,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:43:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 23:43:55,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:43:55,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460139450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:55,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:43:55,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-22 23:43:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455889420] [2022-07-22 23:43:55,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:55,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:43:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:55,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:43:55,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-22 23:43:55,232 INFO L87 Difference]: Start difference. First operand 8031 states and 11763 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:43:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:55,734 INFO L93 Difference]: Finished difference Result 16277 states and 23887 transitions. [2022-07-22 23:43:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:43:55,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2022-07-22 23:43:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:55,763 INFO L225 Difference]: With dead ends: 16277 [2022-07-22 23:43:55,764 INFO L226 Difference]: Without dead ends: 8269 [2022-07-22 23:43:55,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-22 23:43:55,784 INFO L413 NwaCegarLoop]: 1289 mSDtfsCounter, 256 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:55,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 2273 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 23:43:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8269 states. [2022-07-22 23:43:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8269 to 8031. [2022-07-22 23:43:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8031 states, 5937 states have (on average 1.345123799898939) internal successors, (7986), 6099 states have internal predecessors, (7986), 1566 states have call successors, (1566), 352 states have call predecessors, (1566), 527 states have return successors, (2203), 1659 states have call predecessors, (2203), 1563 states have call successors, (2203) [2022-07-22 23:43:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8031 states to 8031 states and 11755 transitions. [2022-07-22 23:43:56,162 INFO L78 Accepts]: Start accepts. Automaton has 8031 states and 11755 transitions. Word has length 152 [2022-07-22 23:43:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:56,163 INFO L495 AbstractCegarLoop]: Abstraction has 8031 states and 11755 transitions. [2022-07-22 23:43:56,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:43:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 8031 states and 11755 transitions. [2022-07-22 23:43:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-22 23:43:56,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:56,174 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:43:56,207 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-22 23:43:56,399 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,SelfDestructingSolverStorable9 [2022-07-22 23:43:56,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 620818428, now seen corresponding path program 1 times [2022-07-22 23:43:56,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:56,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091088428] [2022-07-22 23:43:56,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:56,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:43:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:43:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 23:43:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:43:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 23:43:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 23:43:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:43:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:43:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 23:43:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:43:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:43:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:43:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:43:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:43:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 23:43:56,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:56,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091088428] [2022-07-22 23:43:56,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091088428] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:43:56,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109916064] [2022-07-22 23:43:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:56,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:43:56,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:43:56,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:43:56,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 23:43:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:57,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 2801 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-22 23:43:57,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:43:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 23:43:57,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:43:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 23:43:58,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109916064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 23:43:58,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 23:43:58,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 31 [2022-07-22 23:43:58,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414658701] [2022-07-22 23:43:58,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 23:43:58,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 23:43:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:58,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 23:43:58,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2022-07-22 23:43:58,134 INFO L87 Difference]: Start difference. First operand 8031 states and 11755 transitions. Second operand has 31 states, 31 states have (on average 6.387096774193548) internal successors, (198), 17 states have internal predecessors, (198), 3 states have call successors, (44), 10 states have call predecessors, (44), 8 states have return successors, (36), 9 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-22 23:44:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:07,065 INFO L93 Difference]: Finished difference Result 23225 states and 36925 transitions. [2022-07-22 23:44:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 23:44:07,066 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.387096774193548) internal successors, (198), 17 states have internal predecessors, (198), 3 states have call successors, (44), 10 states have call predecessors, (44), 8 states have return successors, (36), 9 states have call predecessors, (36), 3 states have call successors, (36) Word has length 157 [2022-07-22 23:44:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:07,158 INFO L225 Difference]: With dead ends: 23225 [2022-07-22 23:44:07,159 INFO L226 Difference]: Without dead ends: 15201 [2022-07-22 23:44:07,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=1832, Unknown=0, NotChecked=0, Total=2070 [2022-07-22 23:44:07,201 INFO L413 NwaCegarLoop]: 1287 mSDtfsCounter, 3618 mSDsluCounter, 17506 mSDsCounter, 0 mSdLazyCounter, 11267 mSolverCounterSat, 2103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3758 SdHoareTripleChecker+Valid, 18793 SdHoareTripleChecker+Invalid, 13370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2103 IncrementalHoareTripleChecker+Valid, 11267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:07,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3758 Valid, 18793 Invalid, 13370 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2103 Valid, 11267 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-07-22 23:44:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15201 states. [2022-07-22 23:44:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15201 to 8095. [2022-07-22 23:44:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8095 states, 5989 states have (on average 1.3421272332609784) internal successors, (8038), 6147 states have internal predecessors, (8038), 1566 states have call successors, (1566), 352 states have call predecessors, (1566), 539 states have return successors, (2243), 1675 states have call predecessors, (2243), 1563 states have call successors, (2243) [2022-07-22 23:44:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 11847 transitions. [2022-07-22 23:44:08,020 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 11847 transitions. Word has length 157 [2022-07-22 23:44:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:08,020 INFO L495 AbstractCegarLoop]: Abstraction has 8095 states and 11847 transitions. [2022-07-22 23:44:08,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.387096774193548) internal successors, (198), 17 states have internal predecessors, (198), 3 states have call successors, (44), 10 states have call predecessors, (44), 8 states have return successors, (36), 9 states have call predecessors, (36), 3 states have call successors, (36) [2022-07-22 23:44:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 11847 transitions. [2022-07-22 23:44:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-22 23:44:08,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:08,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:08,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 23:44:08,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:44:08,248 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:08,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1788786096, now seen corresponding path program 1 times [2022-07-22 23:44:08,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:08,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548424786] [2022-07-22 23:44:08,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:08,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:44:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:44:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 23:44:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:44:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:44:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 23:44:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:44:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 23:44:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:44:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:44:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:44:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 23:44:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:08,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548424786] [2022-07-22 23:44:08,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548424786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:08,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:44:08,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-22 23:44:08,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151859166] [2022-07-22 23:44:08,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:08,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 23:44:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:08,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 23:44:08,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-22 23:44:08,677 INFO L87 Difference]: Start difference. First operand 8095 states and 11847 transitions. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (19), 10 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 23:44:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:12,551 INFO L93 Difference]: Finished difference Result 17480 states and 25811 transitions. [2022-07-22 23:44:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 23:44:12,552 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (19), 10 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 169 [2022-07-22 23:44:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:12,594 INFO L225 Difference]: With dead ends: 17480 [2022-07-22 23:44:12,594 INFO L226 Difference]: Without dead ends: 9408 [2022-07-22 23:44:12,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-07-22 23:44:12,619 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 1764 mSDsluCounter, 4632 mSDsCounter, 0 mSdLazyCounter, 3120 mSolverCounterSat, 1239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 5637 SdHoareTripleChecker+Invalid, 4359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1239 IncrementalHoareTripleChecker+Valid, 3120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:12,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 5637 Invalid, 4359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1239 Valid, 3120 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-22 23:44:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9408 states. [2022-07-22 23:44:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9408 to 8135. [2022-07-22 23:44:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8135 states, 6021 states have (on average 1.3416376017272877) internal successors, (8078), 6171 states have internal predecessors, (8078), 1574 states have call successors, (1574), 352 states have call predecessors, (1574), 539 states have return successors, (2251), 1691 states have call predecessors, (2251), 1571 states have call successors, (2251) [2022-07-22 23:44:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8135 states to 8135 states and 11903 transitions. [2022-07-22 23:44:13,251 INFO L78 Accepts]: Start accepts. Automaton has 8135 states and 11903 transitions. Word has length 169 [2022-07-22 23:44:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:13,252 INFO L495 AbstractCegarLoop]: Abstraction has 8135 states and 11903 transitions. [2022-07-22 23:44:13,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (19), 10 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 23:44:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8135 states and 11903 transitions. [2022-07-22 23:44:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-22 23:44:13,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:13,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:13,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 23:44:13,264 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:13,264 INFO L85 PathProgramCache]: Analyzing trace with hash -92495082, now seen corresponding path program 1 times [2022-07-22 23:44:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:13,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981436367] [2022-07-22 23:44:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:13,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:44:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 23:44:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 23:44:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:44:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:44:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 23:44:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-22 23:44:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:44:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:44:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:44:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-22 23:44:13,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:13,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981436367] [2022-07-22 23:44:13,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981436367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:13,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:44:13,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 23:44:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936117846] [2022-07-22 23:44:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:13,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 23:44:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 23:44:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:44:13,614 INFO L87 Difference]: Start difference. First operand 8135 states and 11903 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 10 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:44:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:17,719 INFO L93 Difference]: Finished difference Result 17522 states and 25845 transitions. [2022-07-22 23:44:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 23:44:17,720 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 10 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2022-07-22 23:44:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:17,755 INFO L225 Difference]: With dead ends: 17522 [2022-07-22 23:44:17,755 INFO L226 Difference]: Without dead ends: 9406 [2022-07-22 23:44:17,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-07-22 23:44:17,781 INFO L413 NwaCegarLoop]: 996 mSDtfsCounter, 1768 mSDsluCounter, 4631 mSDsCounter, 0 mSdLazyCounter, 3265 mSolverCounterSat, 1234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 5627 SdHoareTripleChecker+Invalid, 4499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1234 IncrementalHoareTripleChecker+Valid, 3265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:17,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1823 Valid, 5627 Invalid, 4499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1234 Valid, 3265 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-22 23:44:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9406 states. [2022-07-22 23:44:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9406 to 8136. [2022-07-22 23:44:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8136 states, 6022 states have (on average 1.3415808701428098) internal successors, (8079), 6172 states have internal predecessors, (8079), 1574 states have call successors, (1574), 352 states have call predecessors, (1574), 539 states have return successors, (2251), 1691 states have call predecessors, (2251), 1571 states have call successors, (2251) [2022-07-22 23:44:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8136 states to 8136 states and 11904 transitions. [2022-07-22 23:44:18,261 INFO L78 Accepts]: Start accepts. Automaton has 8136 states and 11904 transitions. Word has length 175 [2022-07-22 23:44:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:18,261 INFO L495 AbstractCegarLoop]: Abstraction has 8136 states and 11904 transitions. [2022-07-22 23:44:18,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 10 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:44:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8136 states and 11904 transitions. [2022-07-22 23:44:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-22 23:44:18,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:18,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:18,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 23:44:18,275 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash -933269753, now seen corresponding path program 1 times [2022-07-22 23:44:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:18,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046084713] [2022-07-22 23:44:18,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:18,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:44:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:44:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 23:44:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 23:44:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 23:44:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 23:44:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:44:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:44:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:44:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:44:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-22 23:44:18,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:18,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046084713] [2022-07-22 23:44:18,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046084713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:44:18,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954840016] [2022-07-22 23:44:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:18,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:44:18,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:44:18,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:44:18,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 23:44:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:19,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-22 23:44:19,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:44:19,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 23:44:19,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 23:44:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 23:44:19,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:44:19,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954840016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:19,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:44:19,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2022-07-22 23:44:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711396511] [2022-07-22 23:44:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:19,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 23:44:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:19,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 23:44:19,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-07-22 23:44:19,625 INFO L87 Difference]: Start difference. First operand 8136 states and 11904 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-22 23:44:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:21,584 INFO L93 Difference]: Finished difference Result 18024 states and 26640 transitions. [2022-07-22 23:44:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 23:44:21,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19) Word has length 176 [2022-07-22 23:44:21,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:21,621 INFO L225 Difference]: With dead ends: 18024 [2022-07-22 23:44:21,621 INFO L226 Difference]: Without dead ends: 9912 [2022-07-22 23:44:21,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2022-07-22 23:44:21,644 INFO L413 NwaCegarLoop]: 2198 mSDtfsCounter, 1850 mSDsluCounter, 18751 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1892 SdHoareTripleChecker+Valid, 20949 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:21,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1892 Valid, 20949 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-22 23:44:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9912 states. [2022-07-22 23:44:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9912 to 8103. [2022-07-22 23:44:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 5997 states have (on average 1.3408370852092713) internal successors, (8041), 6147 states have internal predecessors, (8041), 1566 states have call successors, (1566), 352 states have call predecessors, (1566), 539 states have return successors, (2243), 1683 states have call predecessors, (2243), 1563 states have call successors, (2243) [2022-07-22 23:44:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 11850 transitions. [2022-07-22 23:44:22,106 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 11850 transitions. Word has length 176 [2022-07-22 23:44:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:22,106 INFO L495 AbstractCegarLoop]: Abstraction has 8103 states and 11850 transitions. [2022-07-22 23:44:22,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-22 23:44:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 11850 transitions. [2022-07-22 23:44:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-22 23:44:22,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:22,120 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 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] [2022-07-22 23:44:22,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 23:44:22,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:44:22,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:22,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1055633972, now seen corresponding path program 1 times [2022-07-22 23:44:22,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:22,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034516949] [2022-07-22 23:44:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:22,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:44:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:44:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 23:44:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 23:44:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 23:44:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 23:44:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:44:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 23:44:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 23:44:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:44:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:44:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:44:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 23:44:22,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:22,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034516949] [2022-07-22 23:44:22,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034516949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:44:22,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82281766] [2022-07-22 23:44:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:22,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:44:22,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:44:22,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:44:22,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 23:44:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:23,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 2998 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 23:44:23,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:44:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 23:44:23,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:44:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-22 23:44:24,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82281766] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 23:44:24,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 23:44:24,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 21 [2022-07-22 23:44:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586884758] [2022-07-22 23:44:24,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 23:44:24,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 23:44:24,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:24,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 23:44:24,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-22 23:44:24,032 INFO L87 Difference]: Start difference. First operand 8103 states and 11850 transitions. Second operand has 21 states, 21 states have (on average 10.857142857142858) internal successors, (228), 13 states have internal predecessors, (228), 4 states have call successors, (54), 10 states have call predecessors, (54), 5 states have return successors, (46), 5 states have call predecessors, (46), 4 states have call successors, (46) [2022-07-22 23:44:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:32,212 INFO L93 Difference]: Finished difference Result 18431 states and 27411 transitions. [2022-07-22 23:44:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-22 23:44:32,213 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.857142857142858) internal successors, (228), 13 states have internal predecessors, (228), 4 states have call successors, (54), 10 states have call predecessors, (54), 5 states have return successors, (46), 5 states have call predecessors, (46), 4 states have call successors, (46) Word has length 196 [2022-07-22 23:44:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:32,253 INFO L225 Difference]: With dead ends: 18431 [2022-07-22 23:44:32,253 INFO L226 Difference]: Without dead ends: 10346 [2022-07-22 23:44:32,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2022-07-22 23:44:32,277 INFO L413 NwaCegarLoop]: 1308 mSDtfsCounter, 8018 mSDsluCounter, 10222 mSDsCounter, 0 mSdLazyCounter, 8088 mSolverCounterSat, 5143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8116 SdHoareTripleChecker+Valid, 11530 SdHoareTripleChecker+Invalid, 13231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5143 IncrementalHoareTripleChecker+Valid, 8088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:32,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8116 Valid, 11530 Invalid, 13231 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5143 Valid, 8088 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-22 23:44:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10346 states. [2022-07-22 23:44:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10346 to 7838. [2022-07-22 23:44:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7838 states, 5812 states have (on average 1.3406744666207846) internal successors, (7792), 5954 states have internal predecessors, (7792), 1492 states have call successors, (1492), 348 states have call predecessors, (1492), 533 states have return successors, (2145), 1615 states have call predecessors, (2145), 1489 states have call successors, (2145) [2022-07-22 23:44:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 11429 transitions. [2022-07-22 23:44:32,941 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 11429 transitions. Word has length 196 [2022-07-22 23:44:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:32,941 INFO L495 AbstractCegarLoop]: Abstraction has 7838 states and 11429 transitions. [2022-07-22 23:44:32,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.857142857142858) internal successors, (228), 13 states have internal predecessors, (228), 4 states have call successors, (54), 10 states have call predecessors, (54), 5 states have return successors, (46), 5 states have call predecessors, (46), 4 states have call successors, (46) [2022-07-22 23:44:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 11429 transitions. [2022-07-22 23:44:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-22 23:44:32,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:32,954 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 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] [2022-07-22 23:44:32,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 23:44:33,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 23:44:33,180 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:33,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1991704043, now seen corresponding path program 2 times [2022-07-22 23:44:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:33,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281819261] [2022-07-22 23:44:33,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:33,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:44:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 23:44:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 23:44:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 23:44:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 23:44:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 23:44:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 23:44:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:33,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:44:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-22 23:44:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:44:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:34,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:34,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:44:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:34,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:44:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-22 23:44:34,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:34,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281819261] [2022-07-22 23:44:34,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281819261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:44:34,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619953350] [2022-07-22 23:44:34,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 23:44:34,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:44:34,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:44:34,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:44:34,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 23:44:35,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 23:44:35,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 23:44:35,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 3043 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-22 23:44:35,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:44:35,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 23:44:35,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 23:44:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-22 23:44:35,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:44:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-22 23:44:35,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619953350] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 23:44:35,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 23:44:35,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12, 8] total 30 [2022-07-22 23:44:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689940094] [2022-07-22 23:44:35,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 23:44:35,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-22 23:44:35,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:35,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-22 23:44:35,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2022-07-22 23:44:35,909 INFO L87 Difference]: Start difference. First operand 7838 states and 11429 transitions. Second operand has 30 states, 30 states have (on average 5.9) internal successors, (177), 19 states have internal predecessors, (177), 8 states have call successors, (49), 11 states have call predecessors, (49), 8 states have return successors, (36), 12 states have call predecessors, (36), 8 states have call successors, (36) [2022-07-22 23:44:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:55,588 INFO L93 Difference]: Finished difference Result 20972 states and 31872 transitions. [2022-07-22 23:44:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-22 23:44:55,588 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.9) internal successors, (177), 19 states have internal predecessors, (177), 8 states have call successors, (49), 11 states have call predecessors, (49), 8 states have return successors, (36), 12 states have call predecessors, (36), 8 states have call successors, (36) Word has length 199 [2022-07-22 23:44:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:55,625 INFO L225 Difference]: With dead ends: 20972 [2022-07-22 23:44:55,626 INFO L226 Difference]: Without dead ends: 13161 [2022-07-22 23:44:55,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 443 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=613, Invalid=3677, Unknown=0, NotChecked=0, Total=4290 [2022-07-22 23:44:55,644 INFO L413 NwaCegarLoop]: 1892 mSDtfsCounter, 9748 mSDsluCounter, 24998 mSDsCounter, 0 mSdLazyCounter, 21629 mSolverCounterSat, 4942 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9883 SdHoareTripleChecker+Valid, 26890 SdHoareTripleChecker+Invalid, 26571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4942 IncrementalHoareTripleChecker+Valid, 21629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:55,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9883 Valid, 26890 Invalid, 26571 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4942 Valid, 21629 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2022-07-22 23:44:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13161 states. [2022-07-22 23:44:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13161 to 7810. [2022-07-22 23:44:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7810 states, 5792 states have (on average 1.339779005524862) internal successors, (7760), 5934 states have internal predecessors, (7760), 1484 states have call successors, (1484), 348 states have call predecessors, (1484), 533 states have return successors, (2137), 1607 states have call predecessors, (2137), 1481 states have call successors, (2137) [2022-07-22 23:44:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7810 states to 7810 states and 11381 transitions. [2022-07-22 23:44:56,332 INFO L78 Accepts]: Start accepts. Automaton has 7810 states and 11381 transitions. Word has length 199 [2022-07-22 23:44:56,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:56,332 INFO L495 AbstractCegarLoop]: Abstraction has 7810 states and 11381 transitions. [2022-07-22 23:44:56,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.9) internal successors, (177), 19 states have internal predecessors, (177), 8 states have call successors, (49), 11 states have call predecessors, (49), 8 states have return successors, (36), 12 states have call predecessors, (36), 8 states have call successors, (36) [2022-07-22 23:44:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 7810 states and 11381 transitions. [2022-07-22 23:44:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-22 23:44:56,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:56,341 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 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] [2022-07-22 23:44:56,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 23:44:56,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 23:44:56,542 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:56,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1741297651, now seen corresponding path program 1 times [2022-07-22 23:44:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:56,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877694660] [2022-07-22 23:44:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:44:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 23:44:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 23:44:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 23:44:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 23:44:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 23:44:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 23:44:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:44:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 23:44:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 23:44:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-22 23:44:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 23:44:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-22 23:44:56,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:56,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877694660] [2022-07-22 23:44:56,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877694660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:44:56,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138645581] [2022-07-22 23:44:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:56,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:44:56,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:44:56,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:44:56,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 23:44:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 3222 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 23:44:57,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:44:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-22 23:44:57,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:44:57,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138645581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:57,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:44:57,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 11 [2022-07-22 23:44:57,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63894770] [2022-07-22 23:44:57,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:57,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:44:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:57,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:44:57,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-22 23:44:57,743 INFO L87 Difference]: Start difference. First operand 7810 states and 11381 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-22 23:44:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:59,463 INFO L93 Difference]: Finished difference Result 23381 states and 34090 transitions. [2022-07-22 23:44:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 23:44:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 202 [2022-07-22 23:44:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:59,532 INFO L225 Difference]: With dead ends: 23381 [2022-07-22 23:44:59,532 INFO L226 Difference]: Without dead ends: 23364 [2022-07-22 23:44:59,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-22 23:44:59,548 INFO L413 NwaCegarLoop]: 2392 mSDtfsCounter, 2108 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:59,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 4453 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 23:44:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23364 states. [2022-07-22 23:45:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23364 to 23326. [2022-07-22 23:45:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23326 states, 17292 states have (on average 1.340735600277585) internal successors, (23184), 17730 states have internal predecessors, (23184), 4440 states have call successors, (4440), 1036 states have call predecessors, (4440), 1593 states have return successors, (6405), 4799 states have call predecessors, (6405), 4437 states have call successors, (6405) [2022-07-22 23:45:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23326 states to 23326 states and 34029 transitions. [2022-07-22 23:45:01,289 INFO L78 Accepts]: Start accepts. Automaton has 23326 states and 34029 transitions. Word has length 202 [2022-07-22 23:45:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:45:01,289 INFO L495 AbstractCegarLoop]: Abstraction has 23326 states and 34029 transitions. [2022-07-22 23:45:01,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-22 23:45:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 23326 states and 34029 transitions. [2022-07-22 23:45:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-22 23:45:01,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:45:01,304 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 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] [2022-07-22 23:45:01,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 23:45:01,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:45:01,505 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:45:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:45:01,505 INFO L85 PathProgramCache]: Analyzing trace with hash 730180401, now seen corresponding path program 1 times [2022-07-22 23:45:01,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:45:01,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393231429] [2022-07-22 23:45:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:01,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:45:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:45:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 23:45:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 23:45:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 23:45:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 23:45:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 23:45:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:45:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 23:45:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:45:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 23:45:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 23:45:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-22 23:45:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 23:45:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-22 23:45:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:45:01,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393231429] [2022-07-22 23:45:01,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393231429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:45:01,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:45:01,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 23:45:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536053090] [2022-07-22 23:45:01,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:45:01,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 23:45:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:45:01,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 23:45:01,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-22 23:45:01,872 INFO L87 Difference]: Start difference. First operand 23326 states and 34029 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (18), 8 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-22 23:45:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:45:11,827 INFO L93 Difference]: Finished difference Result 84685 states and 126400 transitions. [2022-07-22 23:45:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 23:45:11,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (18), 8 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 202 [2022-07-22 23:45:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:45:12,039 INFO L225 Difference]: With dead ends: 84685 [2022-07-22 23:45:12,039 INFO L226 Difference]: Without dead ends: 61386 [2022-07-22 23:45:12,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-07-22 23:45:12,104 INFO L413 NwaCegarLoop]: 1190 mSDtfsCounter, 5666 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 3488 mSolverCounterSat, 3656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5767 SdHoareTripleChecker+Valid, 4951 SdHoareTripleChecker+Invalid, 7144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3656 IncrementalHoareTripleChecker+Valid, 3488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:45:12,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5767 Valid, 4951 Invalid, 7144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3656 Valid, 3488 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-22 23:45:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61386 states. [2022-07-22 23:45:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61386 to 22274. [2022-07-22 23:45:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22274 states, 16492 states have (on average 1.343439243269464) internal successors, (22156), 16894 states have internal predecessors, (22156), 4344 states have call successors, (4344), 1036 states have call predecessors, (4344), 1437 states have return successors, (5709), 4607 states have call predecessors, (5709), 4341 states have call successors, (5709) [2022-07-22 23:45:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22274 states to 22274 states and 32209 transitions. [2022-07-22 23:45:14,600 INFO L78 Accepts]: Start accepts. Automaton has 22274 states and 32209 transitions. Word has length 202 [2022-07-22 23:45:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:45:14,600 INFO L495 AbstractCegarLoop]: Abstraction has 22274 states and 32209 transitions. [2022-07-22 23:45:14,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (18), 8 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-22 23:45:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22274 states and 32209 transitions. [2022-07-22 23:45:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-22 23:45:14,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:45:14,613 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 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, 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] [2022-07-22 23:45:14,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 23:45:14,614 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:45:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:45:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1833483783, now seen corresponding path program 1 times [2022-07-22 23:45:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:45:14,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542782750] [2022-07-22 23:45:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:45:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:45:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 23:45:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 23:45:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 23:45:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 23:45:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 23:45:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:45:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 23:45:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:45:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 23:45:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-22 23:45:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:45:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:45:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:45:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:17,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:45:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:17,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:45:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-22 23:45:17,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:45:17,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542782750] [2022-07-22 23:45:17,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542782750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:45:17,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781535122] [2022-07-22 23:45:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:17,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:45:17,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:45:17,200 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:45:17,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 23:45:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:18,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 3119 conjuncts, 140 conjunts are in the unsatisfiable core [2022-07-22 23:45:18,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:45:18,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 23:45:18,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 23:45:19,162 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 23:45:19,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 23:45:19,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:45:19,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 23:45:19,389 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 23:45:19,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 23:45:19,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:45:19,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 23:45:19,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-22 23:45:19,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-22 23:45:19,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-22 23:45:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 54 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-22 23:45:19,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:45:29,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781535122] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:45:29,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 23:45:29,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 22] total 52 [2022-07-22 23:45:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935802425] [2022-07-22 23:45:29,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 23:45:29,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-22 23:45:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:45:29,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-22 23:45:29,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=3500, Unknown=2, NotChecked=0, Total=3782 [2022-07-22 23:45:29,504 INFO L87 Difference]: Start difference. First operand 22274 states and 32209 transitions. Second operand has 52 states, 48 states have (on average 4.375) internal successors, (210), 37 states have internal predecessors, (210), 17 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (36), 21 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-22 23:46:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:07,048 INFO L93 Difference]: Finished difference Result 66574 states and 102521 transitions. [2022-07-22 23:46:07,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-07-22 23:46:07,048 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 4.375) internal successors, (210), 37 states have internal predecessors, (210), 17 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (36), 21 states have call predecessors, (36), 16 states have call successors, (36) Word has length 212 [2022-07-22 23:46:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:07,198 INFO L225 Difference]: With dead ends: 66574 [2022-07-22 23:46:07,198 INFO L226 Difference]: Without dead ends: 44327 [2022-07-22 23:46:07,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 328 SyntacticMatches, 5 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7087 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=2210, Invalid=21658, Unknown=2, NotChecked=0, Total=23870 [2022-07-22 23:46:07,248 INFO L413 NwaCegarLoop]: 1857 mSDtfsCounter, 11576 mSDsluCounter, 37289 mSDsCounter, 0 mSdLazyCounter, 31324 mSolverCounterSat, 6981 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11695 SdHoareTripleChecker+Valid, 39146 SdHoareTripleChecker+Invalid, 41231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 6981 IncrementalHoareTripleChecker+Valid, 31324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2926 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:07,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11695 Valid, 39146 Invalid, 41231 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [6981 Valid, 31324 Invalid, 0 Unknown, 2926 Unchecked, 25.9s Time] [2022-07-22 23:46:07,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44327 states. [2022-07-22 23:46:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44327 to 23102. [2022-07-22 23:46:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23102 states, 17080 states have (on average 1.3379391100702576) internal successors, (22852), 17506 states have internal predecessors, (22852), 4476 states have call successors, (4476), 1108 states have call predecessors, (4476), 1545 states have return successors, (5973), 4751 states have call predecessors, (5973), 4473 states have call successors, (5973) [2022-07-22 23:46:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23102 states to 23102 states and 33301 transitions. [2022-07-22 23:46:09,954 INFO L78 Accepts]: Start accepts. Automaton has 23102 states and 33301 transitions. Word has length 212 [2022-07-22 23:46:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:09,955 INFO L495 AbstractCegarLoop]: Abstraction has 23102 states and 33301 transitions. [2022-07-22 23:46:09,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 4.375) internal successors, (210), 37 states have internal predecessors, (210), 17 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (36), 21 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-22 23:46:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 23102 states and 33301 transitions. [2022-07-22 23:46:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-22 23:46:09,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:09,966 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2022-07-22 23:46:09,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:10,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:46:10,167 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2098825928, now seen corresponding path program 1 times [2022-07-22 23:46:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:46:10,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117840357] [2022-07-22 23:46:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:10,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:46:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:46:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 23:46:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 23:46:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 23:46:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 23:46:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 23:46:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:46:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 23:46:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:46:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 23:46:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 23:46:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-22 23:46:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 23:46:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-22 23:46:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-22 23:46:10,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:46:10,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117840357] [2022-07-22 23:46:10,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117840357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:10,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:10,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 23:46:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643272762] [2022-07-22 23:46:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:10,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 23:46:10,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:46:10,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 23:46:10,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:46:10,518 INFO L87 Difference]: Start difference. First operand 23102 states and 33301 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 23:46:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:18,777 INFO L93 Difference]: Finished difference Result 53277 states and 78143 transitions. [2022-07-22 23:46:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 23:46:18,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 212 [2022-07-22 23:46:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:18,875 INFO L225 Difference]: With dead ends: 53277 [2022-07-22 23:46:18,875 INFO L226 Difference]: Without dead ends: 29854 [2022-07-22 23:46:18,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2022-07-22 23:46:18,924 INFO L413 NwaCegarLoop]: 1419 mSDtfsCounter, 3582 mSDsluCounter, 3641 mSDsCounter, 0 mSdLazyCounter, 3398 mSolverCounterSat, 2559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3667 SdHoareTripleChecker+Valid, 5060 SdHoareTripleChecker+Invalid, 5957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2559 IncrementalHoareTripleChecker+Valid, 3398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:18,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3667 Valid, 5060 Invalid, 5957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2559 Valid, 3398 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-22 23:46:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29854 states. [2022-07-22 23:46:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29854 to 22562. [2022-07-22 23:46:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22562 states, 16630 states have (on average 1.3303668069753458) internal successors, (22124), 17016 states have internal predecessors, (22124), 4416 states have call successors, (4416), 1078 states have call predecessors, (4416), 1515 states have return successors, (5913), 4721 states have call predecessors, (5913), 4413 states have call successors, (5913) [2022-07-22 23:46:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22562 states to 22562 states and 32453 transitions. [2022-07-22 23:46:21,491 INFO L78 Accepts]: Start accepts. Automaton has 22562 states and 32453 transitions. Word has length 212 [2022-07-22 23:46:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:21,492 INFO L495 AbstractCegarLoop]: Abstraction has 22562 states and 32453 transitions. [2022-07-22 23:46:21,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 23:46:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 22562 states and 32453 transitions. [2022-07-22 23:46:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-22 23:46:21,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:21,506 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2022-07-22 23:46:21,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 23:46:21,506 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2079284806, now seen corresponding path program 1 times [2022-07-22 23:46:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:46:21,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905124076] [2022-07-22 23:46:21,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:21,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:46:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:46:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 23:46:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 23:46:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 23:46:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 23:46:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 23:46:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:46:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 23:46:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:46:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 23:46:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 23:46:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-22 23:46:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 23:46:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-22 23:46:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-22 23:46:21,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:46:21,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905124076] [2022-07-22 23:46:21,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905124076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:21,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:21,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 23:46:21,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822364568] [2022-07-22 23:46:21,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:21,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 23:46:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:46:21,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 23:46:21,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:46:21,800 INFO L87 Difference]: Start difference. First operand 22562 states and 32453 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:46:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:26,121 INFO L93 Difference]: Finished difference Result 37057 states and 53972 transitions. [2022-07-22 23:46:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 23:46:26,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 212 [2022-07-22 23:46:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:26,165 INFO L225 Difference]: With dead ends: 37057 [2022-07-22 23:46:26,165 INFO L226 Difference]: Without dead ends: 14521 [2022-07-22 23:46:26,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-22 23:46:26,200 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 2698 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 1951 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1951 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:26,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 3034 Invalid, 3453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1951 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-22 23:46:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14521 states. [2022-07-22 23:46:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14521 to 11016. [2022-07-22 23:46:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11016 states, 8095 states have (on average 1.3268684373069797) internal successors, (10741), 8273 states have internal predecessors, (10741), 2177 states have call successors, (2177), 525 states have call predecessors, (2177), 743 states have return successors, (2924), 2340 states have call predecessors, (2924), 2174 states have call successors, (2924) [2022-07-22 23:46:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11016 states to 11016 states and 15842 transitions. [2022-07-22 23:46:27,298 INFO L78 Accepts]: Start accepts. Automaton has 11016 states and 15842 transitions. Word has length 212 [2022-07-22 23:46:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:27,298 INFO L495 AbstractCegarLoop]: Abstraction has 11016 states and 15842 transitions. [2022-07-22 23:46:27,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (19), 8 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-22 23:46:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 11016 states and 15842 transitions. [2022-07-22 23:46:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-22 23:46:27,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:27,305 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:27,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 23:46:27,305 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1018479461, now seen corresponding path program 1 times [2022-07-22 23:46:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:46:27,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856476854] [2022-07-22 23:46:27,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:46:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:46:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 23:46:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 23:46:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 23:46:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 23:46:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 23:46:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:46:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 23:46:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:46:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 23:46:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 23:46:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 23:46:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:46:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 23:46:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 23:46:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-22 23:46:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:46:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:46:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:46:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:46:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:46:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-22 23:46:27,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:46:27,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856476854] [2022-07-22 23:46:27,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856476854] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:46:27,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813115890] [2022-07-22 23:46:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:27,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:46:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:46:27,925 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:46:27,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 23:46:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:28,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 3517 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 23:46:28,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-22 23:46:28,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:28,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813115890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:28,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:46:28,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 17 [2022-07-22 23:46:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031277129] [2022-07-22 23:46:28,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:28,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 23:46:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:46:28,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 23:46:28,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-22 23:46:28,905 INFO L87 Difference]: Start difference. First operand 11016 states and 15842 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 6 states have internal predecessors, (146), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-22 23:46:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:29,957 INFO L93 Difference]: Finished difference Result 21956 states and 31592 transitions. [2022-07-22 23:46:29,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 23:46:29,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 6 states have internal predecessors, (146), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 2 states have call successors, (26) Word has length 247 [2022-07-22 23:46:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:29,996 INFO L225 Difference]: With dead ends: 21956 [2022-07-22 23:46:29,996 INFO L226 Difference]: Without dead ends: 11040 [2022-07-22 23:46:30,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-07-22 23:46:30,021 INFO L413 NwaCegarLoop]: 1123 mSDtfsCounter, 2 mSDsluCounter, 6722 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7845 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:30,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7845 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 23:46:30,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11040 states. [2022-07-22 23:46:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11040 to 11040. [2022-07-22 23:46:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 8119 states have (on average 1.3259022047050129) internal successors, (10765), 8285 states have internal predecessors, (10765), 2177 states have call successors, (2177), 525 states have call predecessors, (2177), 743 states have return successors, (2924), 2352 states have call predecessors, (2924), 2174 states have call successors, (2924) [2022-07-22 23:46:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 15866 transitions. [2022-07-22 23:46:31,285 INFO L78 Accepts]: Start accepts. Automaton has 11040 states and 15866 transitions. Word has length 247 [2022-07-22 23:46:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:31,285 INFO L495 AbstractCegarLoop]: Abstraction has 11040 states and 15866 transitions. [2022-07-22 23:46:31,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 6 states have internal predecessors, (146), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-22 23:46:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 11040 states and 15866 transitions. [2022-07-22 23:46:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-22 23:46:31,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:31,295 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:31,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:31,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:46:31,497 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:31,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:31,497 INFO L85 PathProgramCache]: Analyzing trace with hash -270283457, now seen corresponding path program 2 times [2022-07-22 23:46:31,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:46:31,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727015146] [2022-07-22 23:46:31,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:31,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:46:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:32,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 23:46:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:32,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 23:46:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:32,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 23:46:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:32,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:32,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 23:46:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 23:46:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 23:46:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:46:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 23:46:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:46:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:33,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 23:46:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:46:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:34,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:46:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-22 23:46:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:34,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-22 23:46:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:46:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 23:46:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:34,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 23:46:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-22 23:46:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:35,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 23:46:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:46:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:35,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:46:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:35,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 23:46:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 23:46:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 30 proven. 46 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-22 23:46:35,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:46:35,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727015146] [2022-07-22 23:46:35,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727015146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:46:35,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490398564] [2022-07-22 23:46:35,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 23:46:35,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:46:35,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:46:35,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:46:35,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 23:46:38,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 23:46:38,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 23:46:38,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 3543 conjuncts, 232 conjunts are in the unsatisfiable core [2022-07-22 23:46:38,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:38,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 23:46:38,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 23:46:39,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-22 23:46:39,249 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 23:46:39,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 23:46:39,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 23:46:39,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 23:46:39,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 23:46:40,517 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 23:46:40,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 23:46:40,645 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 23:46:40,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 23:46:40,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:46:40,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 23:46:41,438 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 23:46:41,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-07-22 23:46:41,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-22 23:46:41,481 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 23:46:41,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-07-22 23:46:41,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-22 23:46:41,527 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 23:46:41,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-22 23:46:41,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-07-22 23:46:42,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-22 23:46:42,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-22 23:46:42,321 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 23:46:42,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 26 [2022-07-22 23:46:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 54 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 23:46:42,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:46:44,402 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod (+ c_~usb_urb~0.offset c_~usb_urb~0.base) 18446744073709551616) 0) (forall ((v_ArrVal_2868 (Array Int Int)) (v_ArrVal_2867 (Array Int Int))) (= (mod (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.base|) (+ 51 |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.offset|))) (.cse1 (+ 20 |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2867) |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.base|) .cse1) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2868) |c_ULTIMATE.start_if_usb_probe_~cardp~3#1.base|) .cse1))) 18446744073709551616) (mod (+ c_~usb_urb~0.offset c_~usb_urb~0.base) 18446744073709551616)))) is different from false [2022-07-22 23:46:44,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490398564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:46:44,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 23:46:44,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 44] total 93 [2022-07-22 23:46:44,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289985942] [2022-07-22 23:46:44,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 23:46:44,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-07-22 23:46:44,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:46:44,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-07-22 23:46:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=10451, Unknown=15, NotChecked=206, Total=11130 [2022-07-22 23:46:44,407 INFO L87 Difference]: Start difference. First operand 11040 states and 15866 transitions. Second operand has 93 states, 88 states have (on average 3.102272727272727) internal successors, (273), 72 states have internal predecessors, (273), 32 states have call successors, (59), 17 states have call predecessors, (59), 26 states have return successors, (52), 38 states have call predecessors, (52), 31 states have call successors, (52)