./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.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-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.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 a45fd6cc499457b8646fc297298cfc21cc57c7198001d9ae53614774c0beef98 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 01:48:00,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 01:48:00,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 01:48:00,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 01:48:00,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 01:48:00,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 01:48:00,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 01:48:00,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 01:48:00,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 01:48:00,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 01:48:00,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 01:48:00,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 01:48:00,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 01:48:00,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 01:48:00,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 01:48:00,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 01:48:00,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 01:48:00,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 01:48:00,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 01:48:00,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 01:48:00,786 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 01:48:00,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 01:48:00,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 01:48:00,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 01:48:00,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 01:48:00,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 01:48:00,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 01:48:00,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 01:48:00,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 01:48:00,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 01:48:00,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 01:48:00,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 01:48:00,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 01:48:00,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 01:48:00,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 01:48:00,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 01:48:00,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 01:48:00,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 01:48:00,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 01:48:00,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 01:48:00,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 01:48:00,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 01:48:00,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 01:48:00,836 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 01:48:00,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 01:48:00,839 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 01:48:00,839 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 01:48:00,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 01:48:00,840 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 01:48:00,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 01:48:00,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 01:48:00,841 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 01:48:00,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 01:48:00,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 01:48:00,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 01:48:00,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 01:48:00,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 01:48:00,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 01:48:00,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 01:48:00,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 01:48:00,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 01:48:00,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 01:48:00,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 01:48:00,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 01:48:00,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 01:48:00,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 01:48:00,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 01:48:00,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 01:48:00,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 01:48:00,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 01:48:00,845 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 01:48:00,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 01:48:00,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 01:48:00,845 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 -> a45fd6cc499457b8646fc297298cfc21cc57c7198001d9ae53614774c0beef98 [2022-07-23 01:48:01,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 01:48:01,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 01:48:01,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 01:48:01,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 01:48:01,065 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 01:48:01,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-23 01:48:01,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69ae6cca/a65d07a2522045dfae8b45c6e36daf1f/FLAGa71f6a731 [2022-07-23 01:48:01,786 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 01:48:01,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-23 01:48:01,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69ae6cca/a65d07a2522045dfae8b45c6e36daf1f/FLAGa71f6a731 [2022-07-23 01:48:01,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69ae6cca/a65d07a2522045dfae8b45c6e36daf1f [2022-07-23 01:48:01,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 01:48:01,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 01:48:01,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 01:48:01,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 01:48:01,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 01:48:01,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:48:01" (1/1) ... [2022-07-23 01:48:01,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ea8b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:01, skipping insertion in model container [2022-07-23 01:48:01,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:48:01" (1/1) ... [2022-07-23 01:48:01,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 01:48:02,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 01:48:03,812 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-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i[318493,318506] [2022-07-23 01:48:03,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 01:48:03,893 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 01:48:04,222 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-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i[318493,318506] [2022-07-23 01:48:04,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 01:48:04,326 INFO L208 MainTranslator]: Completed translation [2022-07-23 01:48:04,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04 WrapperNode [2022-07-23 01:48:04,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 01:48:04,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 01:48:04,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 01:48:04,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 01:48:04,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,535 INFO L137 Inliner]: procedures = 311, calls = 1623, calls flagged for inlining = 133, calls inlined = 130, statements flattened = 4354 [2022-07-23 01:48:04,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 01:48:04,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 01:48:04,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 01:48:04,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 01:48:04,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 01:48:04,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 01:48:04,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 01:48:04,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 01:48:04,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (1/1) ... [2022-07-23 01:48:04,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 01:48:04,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 01:48:04,841 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-23 01:48:04,857 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-23 01:48:04,878 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-23 01:48:04,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-23 01:48:04,878 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev32 [2022-07-23 01:48:04,878 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev32 [2022-07-23 01:48:04,878 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-23 01:48:04,879 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-23 01:48:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure put_rx_struct [2022-07-23 01:48:04,879 INFO L138 BoogieDeclarations]: Found implementation of procedure put_rx_struct [2022-07-23 01:48:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 01:48:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 01:48:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_netif_rx [2022-07-23 01:48:04,879 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_netif_rx [2022-07-23 01:48:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 01:48:04,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 01:48:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 01:48:04,880 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 01:48:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-07-23 01:48:04,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-07-23 01:48:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 01:48:04,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 01:48:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-07-23 01:48:04,880 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-07-23 01:48:04,881 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2022-07-23 01:48:04,881 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2022-07-23 01:48:04,881 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2022-07-23 01:48:04,881 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_cpu_to_dev16 [2022-07-23 01:48:04,881 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_cpu_to_dev16 [2022-07-23 01:48:04,881 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev16_to_cpu [2022-07-23 01:48:04,881 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev16_to_cpu [2022-07-23 01:48:04,881 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_stats [2022-07-23 01:48:04,881 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_stats [2022-07-23 01:48:04,882 INFO L130 BoogieDeclarations]: Found specification of procedure free_rx_struct [2022-07-23 01:48:04,882 INFO L138 BoogieDeclarations]: Found implementation of procedure free_rx_struct [2022-07-23 01:48:04,882 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-23 01:48:04,882 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-23 01:48:04,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-23 01:48:04,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-23 01:48:04,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 01:48:04,882 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 01:48:04,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 01:48:04,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 01:48:04,883 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-23 01:48:04,883 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-23 01:48:04,883 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-23 01:48:04,883 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-23 01:48:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_set_config [2022-07-23 01:48:04,884 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_set_config [2022-07-23 01:48:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_set_endian [2022-07-23 01:48:04,884 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_set_endian [2022-07-23 01:48:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-23 01:48:04,884 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-23 01:48:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 01:48:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-23 01:48:04,885 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-23 01:48:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-23 01:48:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_resume [2022-07-23 01:48:04,886 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_resume [2022-07-23 01:48:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 01:48:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_lte_rx [2022-07-23 01:48:04,887 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_lte_rx [2022-07-23 01:48:04,887 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_sdu_struct [2022-07-23 01:48:04,887 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_sdu_struct [2022-07-23 01:48:04,887 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2022-07-23 01:48:04,887 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2022-07-23 01:48:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-23 01:48:04,888 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-23 01:48:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 01:48:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 01:48:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-23 01:48:04,888 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-23 01:48:04,888 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2022-07-23 01:48:04,889 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2022-07-23 01:48:04,889 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-23 01:48:04,889 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-23 01:48:04,889 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-23 01:48:04,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-23 01:48:04,889 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-23 01:48:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-23 01:48:04,890 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-23 01:48:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-23 01:48:04,890 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-23 01:48:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-23 01:48:04,890 INFO L130 BoogieDeclarations]: Found specification of procedure packet_aggregation [2022-07-23 01:48:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure packet_aggregation [2022-07-23 01:48:04,890 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_tx_struct [2022-07-23 01:48:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_tx_struct [2022-07-23 01:48:04,891 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-07-23 01:48:04,891 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-07-23 01:48:04,891 INFO L130 BoogieDeclarations]: Found specification of procedure find_dev_index [2022-07-23 01:48:04,891 INFO L138 BoogieDeclarations]: Found implementation of procedure find_dev_index [2022-07-23 01:48:04,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 01:48:04,892 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-23 01:48:04,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-23 01:48:04,892 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-23 01:48:04,892 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-23 01:48:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 01:48:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure do_tx [2022-07-23 01:48:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure do_tx [2022-07-23 01:48:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-23 01:48:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-23 01:48:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mark_last_busy [2022-07-23 01:48:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mark_last_busy [2022-07-23 01:48:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 01:48:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_has_listeners [2022-07-23 01:48:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_has_listeners [2022-07-23 01:48:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-23 01:48:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-23 01:48:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-23 01:48:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-23 01:48:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure ether_addr_copy [2022-07-23 01:48:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ether_addr_copy [2022-07-23 01:48:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-23 01:48:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-23 01:48:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-23 01:48:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-23 01:48:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_send_complete [2022-07-23 01:48:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_send_complete [2022-07-23 01:48:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 01:48:04,897 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 01:48:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure ether_setup [2022-07-23 01:48:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-23 01:48:04,899 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-23 01:48:04,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 01:48:04,900 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-23 01:48:04,900 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-23 01:48:04,900 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-23 01:48:04,901 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-23 01:48:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-23 01:48:04,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-23 01:48:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_disconnect [2022-07-23 01:48:04,905 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_disconnect [2022-07-23 01:48:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 01:48:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-23 01:48:04,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-23 01:48:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 01:48:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_usb_recv [2022-07-23 01:48:04,905 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_usb_recv [2022-07-23 01:48:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 01:48:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-23 01:48:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 01:48:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 01:48:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_lte_device [2022-07-23 01:48:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_lte_device [2022-07-23 01:48:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-23 01:48:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-23 01:48:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-23 01:48:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-23 01:48:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-23 01:48:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-23 01:48:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2022-07-23 01:48:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2022-07-23 01:48:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2022-07-23 01:48:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2022-07-23 01:48:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure free_tx_struct [2022-07-23 01:48:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tx_struct [2022-07-23 01:48:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-23 01:48:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-23 01:48:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-23 01:48:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-23 01:48:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure gdm_dev32_to_cpu [2022-07-23 01:48:04,908 INFO L138 BoogieDeclarations]: Found implementation of procedure gdm_dev32_to_cpu [2022-07-23 01:48:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-23 01:48:04,908 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-23 01:48:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure do_rx [2022-07-23 01:48:04,908 INFO L138 BoogieDeclarations]: Found implementation of procedure do_rx [2022-07-23 01:48:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 01:48:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-23 01:48:04,908 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-23 01:48:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure release_usb [2022-07-23 01:48:04,908 INFO L138 BoogieDeclarations]: Found implementation of procedure release_usb [2022-07-23 01:48:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-23 01:48:04,909 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-23 01:48:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-23 01:48:04,909 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-23 01:48:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 01:48:04,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 01:48:05,551 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 01:48:05,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 01:48:05,811 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 01:48:07,672 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 01:48:07,683 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 01:48:07,683 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 01:48:07,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:48:07 BoogieIcfgContainer [2022-07-23 01:48:07,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 01:48:07,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 01:48:07,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 01:48:07,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 01:48:07,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 01:48:01" (1/3) ... [2022-07-23 01:48:07,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd35eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:48:07, skipping insertion in model container [2022-07-23 01:48:07,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:48:04" (2/3) ... [2022-07-23 01:48:07,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd35eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:48:07, skipping insertion in model container [2022-07-23 01:48:07,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:48:07" (3/3) ... [2022-07-23 01:48:07,691 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--staging--gdm724x--gdmulte.ko-entry_point.cil.out.i [2022-07-23 01:48:07,701 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 01:48:07,701 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-23 01:48:07,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 01:48:07,755 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@298ceb4d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9f537c0 [2022-07-23 01:48:07,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-23 01:48:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 1526 states, 1043 states have (on average 1.3883029721955897) internal successors, (1448), 1083 states have internal predecessors, (1448), 404 states have call successors, (404), 78 states have call predecessors, (404), 77 states have return successors, (398), 388 states have call predecessors, (398), 398 states have call successors, (398) [2022-07-23 01:48:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-23 01:48:07,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:48:07,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 01:48:07,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:48:07,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:48:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash 537382679, now seen corresponding path program 1 times [2022-07-23 01:48:07,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:48:07,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258648797] [2022-07-23 01:48:07,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:48:07,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:48:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:48:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:08,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:48:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 01:48:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:08,343 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-23 01:48:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:48:08,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258648797] [2022-07-23 01:48:08,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258648797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:48:08,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:48:08,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 01:48:08,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801165262] [2022-07-23 01:48:08,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:48:08,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 01:48:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:48:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 01:48:08,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 01:48:08,382 INFO L87 Difference]: Start difference. First operand has 1526 states, 1043 states have (on average 1.3883029721955897) internal successors, (1448), 1083 states have internal predecessors, (1448), 404 states have call successors, (404), 78 states have call predecessors, (404), 77 states have return successors, (398), 388 states have call predecessors, (398), 398 states have call successors, (398) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-23 01:48:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:48:11,314 INFO L93 Difference]: Finished difference Result 3355 states and 5176 transitions. [2022-07-23 01:48:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 01:48:11,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-07-23 01:48:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:48:11,373 INFO L225 Difference]: With dead ends: 3355 [2022-07-23 01:48:11,382 INFO L226 Difference]: Without dead ends: 1818 [2022-07-23 01:48:11,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-23 01:48:11,434 INFO L413 NwaCegarLoop]: 2124 mSDtfsCounter, 1041 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 1165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1165 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-23 01:48:11,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 4128 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1165 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-23 01:48:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2022-07-23 01:48:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1510. [2022-07-23 01:48:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1035 states have (on average 1.3371980676328503) internal successors, (1384), 1068 states have internal predecessors, (1384), 398 states have call successors, (398), 77 states have call predecessors, (398), 76 states have return successors, (396), 386 states have call predecessors, (396), 396 states have call successors, (396) [2022-07-23 01:48:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2178 transitions. [2022-07-23 01:48:11,596 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2178 transitions. Word has length 49 [2022-07-23 01:48:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:48:11,597 INFO L495 AbstractCegarLoop]: Abstraction has 1510 states and 2178 transitions. [2022-07-23 01:48:11,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-23 01:48:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2178 transitions. [2022-07-23 01:48:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-23 01:48:11,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:48:11,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 01:48:11,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 01:48:11,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:48:11,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:48:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -491976619, now seen corresponding path program 1 times [2022-07-23 01:48:11,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:48:11,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212345514] [2022-07-23 01:48:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:48:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:48:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:48:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:11,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:48:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 01:48:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:11,817 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-23 01:48:11,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:48:11,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212345514] [2022-07-23 01:48:11,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212345514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:48:11,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:48:11,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 01:48:11,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911615662] [2022-07-23 01:48:11,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:48:11,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 01:48:11,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:48:11,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 01:48:11,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 01:48:11,820 INFO L87 Difference]: Start difference. First operand 1510 states and 2178 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-23 01:48:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:48:16,113 INFO L93 Difference]: Finished difference Result 4855 states and 7262 transitions. [2022-07-23 01:48:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 01:48:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-07-23 01:48:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:48:16,130 INFO L225 Difference]: With dead ends: 4855 [2022-07-23 01:48:16,130 INFO L226 Difference]: Without dead ends: 3355 [2022-07-23 01:48:16,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-23 01:48:16,136 INFO L413 NwaCegarLoop]: 2643 mSDtfsCounter, 4528 mSDsluCounter, 2691 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 3348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4789 SdHoareTripleChecker+Valid, 5334 SdHoareTripleChecker+Invalid, 5568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3348 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-23 01:48:16,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4789 Valid, 5334 Invalid, 5568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3348 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-23 01:48:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-07-23 01:48:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2745. [2022-07-23 01:48:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 1895 states have (on average 1.341424802110818) internal successors, (2542), 1952 states have internal predecessors, (2542), 710 states have call successors, (710), 140 states have call predecessors, (710), 139 states have return successors, (708), 689 states have call predecessors, (708), 708 states have call successors, (708) [2022-07-23 01:48:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3960 transitions. [2022-07-23 01:48:16,237 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3960 transitions. Word has length 49 [2022-07-23 01:48:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:48:16,238 INFO L495 AbstractCegarLoop]: Abstraction has 2745 states and 3960 transitions. [2022-07-23 01:48:16,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-23 01:48:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3960 transitions. [2022-07-23 01:48:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-23 01:48:16,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:48:16,245 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 01:48:16,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 01:48:16,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:48:16,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:48:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash -305469456, now seen corresponding path program 1 times [2022-07-23 01:48:16,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:48:16,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133966833] [2022-07-23 01:48:16,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:48:16,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:48:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:16,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:48:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:16,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:16,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:16,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:48:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 01:48:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:16,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 01:48:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 01:48:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 01:48:16,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:48:16,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133966833] [2022-07-23 01:48:16,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133966833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:48:16,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:48:16,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 01:48:16,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506608921] [2022-07-23 01:48:16,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:48:16,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 01:48:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:48:16,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 01:48:16,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 01:48:16,479 INFO L87 Difference]: Start difference. First operand 2745 states and 3960 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 01:48:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:48:24,025 INFO L93 Difference]: Finished difference Result 9823 states and 14952 transitions. [2022-07-23 01:48:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 01:48:24,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-07-23 01:48:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:48:24,061 INFO L225 Difference]: With dead ends: 9823 [2022-07-23 01:48:24,062 INFO L226 Difference]: Without dead ends: 7088 [2022-07-23 01:48:24,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-23 01:48:24,074 INFO L413 NwaCegarLoop]: 2193 mSDtfsCounter, 5700 mSDsluCounter, 4698 mSDsCounter, 0 mSdLazyCounter, 5457 mSolverCounterSat, 4301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6076 SdHoareTripleChecker+Valid, 6891 SdHoareTripleChecker+Invalid, 9758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4301 IncrementalHoareTripleChecker+Valid, 5457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-23 01:48:24,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6076 Valid, 6891 Invalid, 9758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4301 Valid, 5457 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-23 01:48:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2022-07-23 01:48:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5665. [2022-07-23 01:48:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 3946 states have (on average 1.3563101875316776) internal successors, (5352), 4067 states have internal predecessors, (5352), 1427 states have call successors, (1427), 279 states have call predecessors, (1427), 291 states have return successors, (1511), 1395 states have call predecessors, (1511), 1424 states have call successors, (1511) [2022-07-23 01:48:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 8290 transitions. [2022-07-23 01:48:24,323 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 8290 transitions. Word has length 69 [2022-07-23 01:48:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:48:24,325 INFO L495 AbstractCegarLoop]: Abstraction has 5665 states and 8290 transitions. [2022-07-23 01:48:24,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 01:48:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 8290 transitions. [2022-07-23 01:48:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 01:48:24,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:48:24,327 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 01:48:24,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 01:48:24,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:48:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:48:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1392904398, now seen corresponding path program 1 times [2022-07-23 01:48:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:48:24,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359197914] [2022-07-23 01:48:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:48:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:48:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:24,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:48:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:24,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:24,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:24,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:48:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:24,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-23 01:48:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 01:48:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:24,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 01:48:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 01:48:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:48:24,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359197914] [2022-07-23 01:48:24,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359197914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:48:24,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:48:24,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 01:48:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907568795] [2022-07-23 01:48:24,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:48:24,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 01:48:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:48:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 01:48:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 01:48:24,547 INFO L87 Difference]: Start difference. First operand 5665 states and 8290 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 01:48:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:48:31,217 INFO L93 Difference]: Finished difference Result 16076 states and 24448 transitions. [2022-07-23 01:48:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 01:48:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-07-23 01:48:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:48:31,275 INFO L225 Difference]: With dead ends: 16076 [2022-07-23 01:48:31,275 INFO L226 Difference]: Without dead ends: 10421 [2022-07-23 01:48:31,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-23 01:48:31,295 INFO L413 NwaCegarLoop]: 2170 mSDtfsCounter, 6187 mSDsluCounter, 3665 mSDsCounter, 0 mSdLazyCounter, 4450 mSolverCounterSat, 4459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6558 SdHoareTripleChecker+Valid, 5835 SdHoareTripleChecker+Invalid, 8909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4459 IncrementalHoareTripleChecker+Valid, 4450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-23 01:48:31,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6558 Valid, 5835 Invalid, 8909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4459 Valid, 4450 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-23 01:48:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2022-07-23 01:48:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 8539. [2022-07-23 01:48:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8539 states, 5967 states have (on average 1.3616557734204793) internal successors, (8125), 6156 states have internal predecessors, (8125), 2132 states have call successors, (2132), 418 states have call predecessors, (2132), 439 states have return successors, (2313), 2079 states have call predecessors, (2313), 2128 states have call successors, (2313) [2022-07-23 01:48:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8539 states to 8539 states and 12570 transitions. [2022-07-23 01:48:31,645 INFO L78 Accepts]: Start accepts. Automaton has 8539 states and 12570 transitions. Word has length 68 [2022-07-23 01:48:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:48:31,646 INFO L495 AbstractCegarLoop]: Abstraction has 8539 states and 12570 transitions. [2022-07-23 01:48:31,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 01:48:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 8539 states and 12570 transitions. [2022-07-23 01:48:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 01:48:31,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:48:31,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 01:48:31,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 01:48:31,649 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:48:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:48:31,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1859013993, now seen corresponding path program 1 times [2022-07-23 01:48:31,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:48:31,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503694368] [2022-07-23 01:48:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:48:31,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:48:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:48:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:31,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:31,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:48:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 01:48:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 01:48:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:31,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 01:48:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 01:48:31,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:48:31,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503694368] [2022-07-23 01:48:31,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503694368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:48:31,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:48:31,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 01:48:31,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525000080] [2022-07-23 01:48:31,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:48:31,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 01:48:31,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:48:31,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 01:48:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 01:48:31,824 INFO L87 Difference]: Start difference. First operand 8539 states and 12570 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 01:48:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:48:39,455 INFO L93 Difference]: Finished difference Result 22466 states and 34338 transitions. [2022-07-23 01:48:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 01:48:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-07-23 01:48:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:48:39,514 INFO L225 Difference]: With dead ends: 22466 [2022-07-23 01:48:39,514 INFO L226 Difference]: Without dead ends: 13937 [2022-07-23 01:48:39,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-23 01:48:39,544 INFO L413 NwaCegarLoop]: 2306 mSDtfsCounter, 5463 mSDsluCounter, 4651 mSDsCounter, 0 mSdLazyCounter, 5465 mSolverCounterSat, 4300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5835 SdHoareTripleChecker+Valid, 6957 SdHoareTripleChecker+Invalid, 9765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4300 IncrementalHoareTripleChecker+Valid, 5465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-23 01:48:39,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5835 Valid, 6957 Invalid, 9765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4300 Valid, 5465 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-23 01:48:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2022-07-23 01:48:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 11447. [2022-07-23 01:48:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11447 states, 8012 states have (on average 1.3635796305541688) internal successors, (10925), 8267 states have internal predecessors, (10925), 2843 states have call successors, (2843), 557 states have call predecessors, (2843), 591 states have return successors, (3148), 2777 states have call predecessors, (3148), 2838 states have call successors, (3148) [2022-07-23 01:48:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11447 states to 11447 states and 16916 transitions. [2022-07-23 01:48:40,016 INFO L78 Accepts]: Start accepts. Automaton has 11447 states and 16916 transitions. Word has length 70 [2022-07-23 01:48:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:48:40,017 INFO L495 AbstractCegarLoop]: Abstraction has 11447 states and 16916 transitions. [2022-07-23 01:48:40,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 01:48:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 11447 states and 16916 transitions. [2022-07-23 01:48:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 01:48:40,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:48:40,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 01:48:40,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 01:48:40,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:48:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:48:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1077150297, now seen corresponding path program 1 times [2022-07-23 01:48:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:48:40,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45594055] [2022-07-23 01:48:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:48:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:48:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:40,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:48:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:40,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:48:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 01:48:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 01:48:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 01:48:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 01:48:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:48:40,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45594055] [2022-07-23 01:48:40,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45594055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:48:40,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:48:40,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 01:48:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103554038] [2022-07-23 01:48:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:48:40,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 01:48:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:48:40,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 01:48:40,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 01:48:40,170 INFO L87 Difference]: Start difference. First operand 11447 states and 16916 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 01:48:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:48:45,630 INFO L93 Difference]: Finished difference Result 27908 states and 42487 transitions. [2022-07-23 01:48:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 01:48:45,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-07-23 01:48:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:48:45,698 INFO L225 Difference]: With dead ends: 27908 [2022-07-23 01:48:45,699 INFO L226 Difference]: Without dead ends: 16427 [2022-07-23 01:48:45,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-23 01:48:45,731 INFO L413 NwaCegarLoop]: 2301 mSDtfsCounter, 6933 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 3576 mSolverCounterSat, 5660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7308 SdHoareTripleChecker+Valid, 5376 SdHoareTripleChecker+Invalid, 9236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5660 IncrementalHoareTripleChecker+Valid, 3576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-23 01:48:45,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7308 Valid, 5376 Invalid, 9236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5660 Valid, 3576 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-23 01:48:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16427 states. [2022-07-23 01:48:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16427 to 13502. [2022-07-23 01:48:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13502 states, 9434 states have (on average 1.3522365910536358) internal successors, (12757), 9706 states have internal predecessors, (12757), 3363 states have call successors, (3363), 669 states have call predecessors, (3363), 704 states have return successors, (3683), 3298 states have call predecessors, (3683), 3358 states have call successors, (3683) [2022-07-23 01:48:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13502 states to 13502 states and 19803 transitions. [2022-07-23 01:48:46,282 INFO L78 Accepts]: Start accepts. Automaton has 13502 states and 19803 transitions. Word has length 71 [2022-07-23 01:48:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:48:46,284 INFO L495 AbstractCegarLoop]: Abstraction has 13502 states and 19803 transitions. [2022-07-23 01:48:46,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 01:48:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 13502 states and 19803 transitions. [2022-07-23 01:48:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-23 01:48:46,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:48:46,287 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 01:48:46,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 01:48:46,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:48:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:48:46,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1015390489, now seen corresponding path program 1 times [2022-07-23 01:48:46,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:48:46,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206427152] [2022-07-23 01:48:46,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:48:46,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:48:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:48:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:48:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 01:48:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:46,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:46,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 01:48:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 01:48:46,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:48:46,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206427152] [2022-07-23 01:48:46,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206427152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:48:46,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:48:46,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 01:48:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901873790] [2022-07-23 01:48:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:48:46,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 01:48:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:48:46,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 01:48:46,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 01:48:46,452 INFO L87 Difference]: Start difference. First operand 13502 states and 19803 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 01:48:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:48:49,017 INFO L93 Difference]: Finished difference Result 16802 states and 25517 transitions. [2022-07-23 01:48:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 01:48:49,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2022-07-23 01:48:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:48:49,082 INFO L225 Difference]: With dead ends: 16802 [2022-07-23 01:48:49,083 INFO L226 Difference]: Without dead ends: 16799 [2022-07-23 01:48:49,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-23 01:48:49,094 INFO L413 NwaCegarLoop]: 2132 mSDtfsCounter, 3466 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 2204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3680 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2204 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-23 01:48:49,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3680 Valid, 3393 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2204 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-23 01:48:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2022-07-23 01:48:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 13987. [2022-07-23 01:48:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13987 states, 9744 states have (on average 1.3473932676518883) internal successors, (13129), 10032 states have internal predecessors, (13129), 3467 states have call successors, (3467), 740 states have call predecessors, (3467), 775 states have return successors, (3787), 3402 states have call predecessors, (3787), 3462 states have call successors, (3787) [2022-07-23 01:48:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 20383 transitions. [2022-07-23 01:48:49,721 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 20383 transitions. Word has length 86 [2022-07-23 01:48:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:48:49,722 INFO L495 AbstractCegarLoop]: Abstraction has 13987 states and 20383 transitions. [2022-07-23 01:48:49,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-23 01:48:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 20383 transitions. [2022-07-23 01:48:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-23 01:48:49,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:48:49,734 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, 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-23 01:48:49,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 01:48:49,735 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:48:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:48:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash -565835672, now seen corresponding path program 1 times [2022-07-23 01:48:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:48:49,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4191450] [2022-07-23 01:48:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:48:49,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:48:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:48:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:48:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 01:48:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-23 01:48:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 01:48:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 01:48:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 01:48:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 01:48:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:48:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:48:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 01:48:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-23 01:48:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 01:48:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 01:48:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:48:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-23 01:48:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:48:50,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4191450] [2022-07-23 01:48:50,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4191450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:48:50,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:48:50,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 01:48:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450882829] [2022-07-23 01:48:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:48:50,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 01:48:50,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:48:50,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 01:48:50,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-23 01:48:50,004 INFO L87 Difference]: Start difference. First operand 13987 states and 20383 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-23 01:49:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:49:00,987 INFO L93 Difference]: Finished difference Result 40146 states and 60650 transitions. [2022-07-23 01:49:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 01:49:00,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 173 [2022-07-23 01:49:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:49:01,129 INFO L225 Difference]: With dead ends: 40146 [2022-07-23 01:49:01,130 INFO L226 Difference]: Without dead ends: 26169 [2022-07-23 01:49:01,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-07-23 01:49:01,171 INFO L413 NwaCegarLoop]: 3308 mSDtfsCounter, 6184 mSDsluCounter, 5465 mSDsCounter, 0 mSdLazyCounter, 5123 mSolverCounterSat, 5912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6541 SdHoareTripleChecker+Valid, 8773 SdHoareTripleChecker+Invalid, 11035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5912 IncrementalHoareTripleChecker+Valid, 5123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-23 01:49:01,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6541 Valid, 8773 Invalid, 11035 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5912 Valid, 5123 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-07-23 01:49:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26169 states. [2022-07-23 01:49:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26169 to 20775. [2022-07-23 01:49:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20775 states, 14493 states have (on average 1.3469951010832817) internal successors, (19522), 14905 states have internal predecessors, (19522), 5154 states have call successors, (5154), 1079 states have call predecessors, (5154), 1127 states have return successors, (5608), 5069 states have call predecessors, (5608), 5149 states have call successors, (5608) [2022-07-23 01:49:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20775 states to 20775 states and 30284 transitions. [2022-07-23 01:49:02,287 INFO L78 Accepts]: Start accepts. Automaton has 20775 states and 30284 transitions. Word has length 173 [2022-07-23 01:49:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:49:02,289 INFO L495 AbstractCegarLoop]: Abstraction has 20775 states and 30284 transitions. [2022-07-23 01:49:02,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (22), 8 states have call predecessors, (22), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-23 01:49:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 20775 states and 30284 transitions. [2022-07-23 01:49:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-23 01:49:02,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:49:02,300 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 01:49:02,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 01:49:02,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:49:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:49:02,301 INFO L85 PathProgramCache]: Analyzing trace with hash 684186662, now seen corresponding path program 1 times [2022-07-23 01:49:02,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:49:02,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642471004] [2022-07-23 01:49:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:49:02,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:49:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:49:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:49:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 01:49:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 01:49:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 01:49:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 01:49:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 01:49:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 01:49:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 01:49:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 01:49:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 01:49:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 01:49:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 01:49:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-23 01:49:02,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:49:02,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642471004] [2022-07-23 01:49:02,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642471004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:49:02,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:49:02,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 01:49:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949433277] [2022-07-23 01:49:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:49:02,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 01:49:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:49:02,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 01:49:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-23 01:49:02,579 INFO L87 Difference]: Start difference. First operand 20775 states and 30284 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 01:49:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:49:17,814 INFO L93 Difference]: Finished difference Result 61851 states and 93429 transitions. [2022-07-23 01:49:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 01:49:17,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 186 [2022-07-23 01:49:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:49:18,045 INFO L225 Difference]: With dead ends: 61851 [2022-07-23 01:49:18,045 INFO L226 Difference]: Without dead ends: 41086 [2022-07-23 01:49:18,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-07-23 01:49:18,119 INFO L413 NwaCegarLoop]: 2891 mSDtfsCounter, 6905 mSDsluCounter, 6570 mSDsCounter, 0 mSdLazyCounter, 9091 mSolverCounterSat, 6487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7115 SdHoareTripleChecker+Valid, 9461 SdHoareTripleChecker+Invalid, 15578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6487 IncrementalHoareTripleChecker+Valid, 9091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-07-23 01:49:18,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7115 Valid, 9461 Invalid, 15578 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6487 Valid, 9091 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2022-07-23 01:49:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41086 states. [2022-07-23 01:49:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41086 to 32211. [2022-07-23 01:49:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32211 states, 22368 states have (on average 1.34585121602289) internal successors, (30104), 23071 states have internal predecessors, (30104), 8010 states have call successors, (8010), 1749 states have call predecessors, (8010), 1832 states have return successors, (8761), 7864 states have call predecessors, (8761), 8001 states have call successors, (8761) [2022-07-23 01:49:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46875 transitions. [2022-07-23 01:49:20,418 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46875 transitions. Word has length 186 [2022-07-23 01:49:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:49:20,419 INFO L495 AbstractCegarLoop]: Abstraction has 32211 states and 46875 transitions. [2022-07-23 01:49:20,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (23), 8 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 01:49:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46875 transitions. [2022-07-23 01:49:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-23 01:49:20,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:49:20,472 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 01:49:20,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 01:49:20,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:49:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:49:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1620364600, now seen corresponding path program 1 times [2022-07-23 01:49:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:49:20,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890484524] [2022-07-23 01:49:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:49:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:49:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:49:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:49:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 01:49:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 01:49:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 01:49:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-23 01:49:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 01:49:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 01:49:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 01:49:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 01:49:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 01:49:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 01:49:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 01:49:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 01:49:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-23 01:49:20,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:49:20,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890484524] [2022-07-23 01:49:20,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890484524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:49:20,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:49:20,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 01:49:20,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657379070] [2022-07-23 01:49:20,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:49:20,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 01:49:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:49:20,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 01:49:20,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-23 01:49:20,788 INFO L87 Difference]: Start difference. First operand 32211 states and 46875 transitions. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 01:49:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:49:43,376 INFO L93 Difference]: Finished difference Result 92912 states and 143084 transitions. [2022-07-23 01:49:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 01:49:43,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 203 [2022-07-23 01:49:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:49:43,713 INFO L225 Difference]: With dead ends: 92912 [2022-07-23 01:49:43,713 INFO L226 Difference]: Without dead ends: 60711 [2022-07-23 01:49:43,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2022-07-23 01:49:43,835 INFO L413 NwaCegarLoop]: 2784 mSDtfsCounter, 7741 mSDsluCounter, 8294 mSDsCounter, 0 mSdLazyCounter, 12779 mSolverCounterSat, 7251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7970 SdHoareTripleChecker+Valid, 11078 SdHoareTripleChecker+Invalid, 20030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7251 IncrementalHoareTripleChecker+Valid, 12779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-07-23 01:49:43,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7970 Valid, 11078 Invalid, 20030 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7251 Valid, 12779 Invalid, 0 Unknown, 0 Unchecked, 17.9s Time] [2022-07-23 01:49:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60711 states. [2022-07-23 01:49:46,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60711 to 32211. [2022-07-23 01:49:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32211 states, 22368 states have (on average 1.34585121602289) internal successors, (30104), 23071 states have internal predecessors, (30104), 8010 states have call successors, (8010), 1749 states have call predecessors, (8010), 1832 states have return successors, (8761), 7864 states have call predecessors, (8761), 8001 states have call successors, (8761) [2022-07-23 01:49:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46875 transitions. [2022-07-23 01:49:46,530 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46875 transitions. Word has length 203 [2022-07-23 01:49:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:49:46,530 INFO L495 AbstractCegarLoop]: Abstraction has 32211 states and 46875 transitions. [2022-07-23 01:49:46,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 01:49:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46875 transitions. [2022-07-23 01:49:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-23 01:49:46,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:49:46,545 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 01:49:46,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 01:49:46,545 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:49:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:49:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1718121921, now seen corresponding path program 1 times [2022-07-23 01:49:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:49:46,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702292438] [2022-07-23 01:49:46,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:49:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:49:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:49:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:49:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 01:49:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 01:49:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 01:49:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 01:49:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 01:49:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 01:49:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 01:49:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 01:49:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 01:49:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 01:49:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 01:49:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 01:49:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-23 01:49:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-23 01:49:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-23 01:49:46,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:49:46,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702292438] [2022-07-23 01:49:46,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702292438] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 01:49:46,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356294663] [2022-07-23 01:49:46,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:49:46,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 01:49:46,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 01:49:46,904 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-23 01:49:46,935 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-23 01:49:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:47,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 2553 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 01:49:47,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 01:49:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-23 01:49:47,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 01:49:47,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356294663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:49:47,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 01:49:47,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-23 01:49:47,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914518408] [2022-07-23 01:49:47,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:49:47,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 01:49:47,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:49:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 01:49:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-23 01:49:47,643 INFO L87 Difference]: Start difference. First operand 32211 states and 46875 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 01:49:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:49:50,064 INFO L93 Difference]: Finished difference Result 71007 states and 103338 transitions. [2022-07-23 01:49:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 01:49:50,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 228 [2022-07-23 01:49:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:49:50,244 INFO L225 Difference]: With dead ends: 71007 [2022-07-23 01:49:50,244 INFO L226 Difference]: Without dead ends: 38806 [2022-07-23 01:49:50,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-23 01:49:50,336 INFO L413 NwaCegarLoop]: 2531 mSDtfsCounter, 2115 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 4372 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 01:49:50,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 4372 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 01:49:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38806 states. [2022-07-23 01:49:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38806 to 38774. [2022-07-23 01:49:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38774 states, 26982 states have (on average 1.3472685494033059) internal successors, (36352), 27807 states have internal predecessors, (36352), 9606 states have call successors, (9606), 2090 states have call predecessors, (9606), 2185 states have return successors, (10463), 9430 states have call predecessors, (10463), 9597 states have call successors, (10463) [2022-07-23 01:49:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38774 states to 38774 states and 56421 transitions. [2022-07-23 01:49:52,754 INFO L78 Accepts]: Start accepts. Automaton has 38774 states and 56421 transitions. Word has length 228 [2022-07-23 01:49:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:49:52,755 INFO L495 AbstractCegarLoop]: Abstraction has 38774 states and 56421 transitions. [2022-07-23 01:49:52,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 01:49:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 38774 states and 56421 transitions. [2022-07-23 01:49:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-23 01:49:52,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:49:52,773 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 01:49:52,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 01:49:52,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-23 01:49:52,988 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:49:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:49:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1894528937, now seen corresponding path program 1 times [2022-07-23 01:49:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:49:52,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706820596] [2022-07-23 01:49:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:49:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:49:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:49:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:49:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 01:49:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 01:49:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 01:49:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 01:49:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 01:49:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 01:49:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 01:49:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 01:49:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 01:49:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 01:49:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 01:49:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:49:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:49:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 01:49:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 01:49:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 01:49:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 01:49:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:49:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-23 01:49:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:49:53,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706820596] [2022-07-23 01:49:53,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706820596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:49:53,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:49:53,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 01:49:53,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596854076] [2022-07-23 01:49:53,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:49:53,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 01:49:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:49:53,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 01:49:53,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-23 01:49:53,378 INFO L87 Difference]: Start difference. First operand 38774 states and 56421 transitions. Second operand has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-23 01:50:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:50:19,831 INFO L93 Difference]: Finished difference Result 108472 states and 166707 transitions. [2022-07-23 01:50:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 01:50:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 247 [2022-07-23 01:50:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:50:20,155 INFO L225 Difference]: With dead ends: 108472 [2022-07-23 01:50:20,156 INFO L226 Difference]: Without dead ends: 69708 [2022-07-23 01:50:20,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 01:50:20,270 INFO L413 NwaCegarLoop]: 3271 mSDtfsCounter, 6889 mSDsluCounter, 13673 mSDsCounter, 0 mSdLazyCounter, 18257 mSolverCounterSat, 5226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7113 SdHoareTripleChecker+Valid, 16944 SdHoareTripleChecker+Invalid, 23483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5226 IncrementalHoareTripleChecker+Valid, 18257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-07-23 01:50:20,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7113 Valid, 16944 Invalid, 23483 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5226 Valid, 18257 Invalid, 0 Unknown, 0 Unchecked, 20.5s Time] [2022-07-23 01:50:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69708 states. [2022-07-23 01:50:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69708 to 38789. [2022-07-23 01:50:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38789 states, 26987 states have (on average 1.347204209434172) internal successors, (36357), 27807 states have internal predecessors, (36357), 9616 states have call successors, (9616), 2090 states have call predecessors, (9616), 2185 states have return successors, (10473), 9435 states have call predecessors, (10473), 9607 states have call successors, (10473) [2022-07-23 01:50:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38789 states to 38789 states and 56446 transitions. [2022-07-23 01:50:23,921 INFO L78 Accepts]: Start accepts. Automaton has 38789 states and 56446 transitions. Word has length 247 [2022-07-23 01:50:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:50:23,923 INFO L495 AbstractCegarLoop]: Abstraction has 38789 states and 56446 transitions. [2022-07-23 01:50:23,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (29), 10 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-23 01:50:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 38789 states and 56446 transitions. [2022-07-23 01:50:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-07-23 01:50:23,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:50:23,941 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 01:50:23,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 01:50:23,941 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:50:23,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:50:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash -891727683, now seen corresponding path program 1 times [2022-07-23 01:50:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:50:23,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471843379] [2022-07-23 01:50:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:50:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:50:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:50:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:50:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:50:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-23 01:50:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:50:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 01:50:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:50:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 01:50:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 01:50:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 01:50:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 01:50:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 01:50:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 01:50:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 01:50:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 01:50:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 01:50:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 01:50:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 01:50:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 01:50:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 01:50:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-23 01:50:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-23 01:50:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 01:50:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:50:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-23 01:50:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-23 01:50:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 01:50:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 01:50:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 01:50:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-23 01:50:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:50:24,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471843379] [2022-07-23 01:50:24,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471843379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:50:24,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:50:24,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 01:50:24,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874830454] [2022-07-23 01:50:24,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:50:24,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 01:50:24,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:50:24,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 01:50:24,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 01:50:24,239 INFO L87 Difference]: Start difference. First operand 38789 states and 56446 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-23 01:50:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:50:40,548 INFO L93 Difference]: Finished difference Result 128490 states and 196599 transitions. [2022-07-23 01:50:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 01:50:40,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 259 [2022-07-23 01:50:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:50:41,284 INFO L225 Difference]: With dead ends: 128490 [2022-07-23 01:50:41,284 INFO L226 Difference]: Without dead ends: 89711 [2022-07-23 01:50:41,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-07-23 01:50:41,420 INFO L413 NwaCegarLoop]: 2150 mSDtfsCounter, 7406 mSDsluCounter, 5082 mSDsCounter, 0 mSdLazyCounter, 6718 mSolverCounterSat, 6116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7591 SdHoareTripleChecker+Valid, 7232 SdHoareTripleChecker+Invalid, 12834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6116 IncrementalHoareTripleChecker+Valid, 6718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-23 01:50:41,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7591 Valid, 7232 Invalid, 12834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6116 Valid, 6718 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-07-23 01:50:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89711 states. [2022-07-23 01:50:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89711 to 71119. [2022-07-23 01:50:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71119 states, 49609 states have (on average 1.3663448164647545) internal successors, (67783), 51431 states have internal predecessors, (67783), 17065 states have call successors, (17065), 4023 states have call predecessors, (17065), 4444 states have return successors, (21669), 16776 states have call predecessors, (21669), 17048 states have call successors, (21669) [2022-07-23 01:50:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71119 states to 71119 states and 106517 transitions. [2022-07-23 01:50:47,562 INFO L78 Accepts]: Start accepts. Automaton has 71119 states and 106517 transitions. Word has length 259 [2022-07-23 01:50:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:50:47,562 INFO L495 AbstractCegarLoop]: Abstraction has 71119 states and 106517 transitions. [2022-07-23 01:50:47,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (35), 7 states have call predecessors, (35), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-23 01:50:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 71119 states and 106517 transitions. [2022-07-23 01:50:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-07-23 01:50:47,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:50:47,582 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 01:50:47,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 01:50:47,583 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:50:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:50:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1020658532, now seen corresponding path program 1 times [2022-07-23 01:50:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:50:47,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389884025] [2022-07-23 01:50:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:50:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:50:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:50:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:50:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:50:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 01:50:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:50:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 01:50:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 01:50:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:50:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 01:50:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:50:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 01:50:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 01:50:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 01:50:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 01:50:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 01:50:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 01:50:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 01:50:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 01:50:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 01:50:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 01:50:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 01:50:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 01:50:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 01:50:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 01:50:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 01:50:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 01:50:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-23 01:50:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-23 01:50:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 01:50:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 01:50:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-23 01:50:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-23 01:50:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-23 01:50:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-23 01:50:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-23 01:50:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-23 01:50:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:47,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 01:50:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 01:50:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 01:50:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 01:50:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:50:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:50:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 01:50:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-23 01:50:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2022-07-23 01:50:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-23 01:50:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:50:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-23 01:50:48,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:50:48,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389884025] [2022-07-23 01:50:48,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389884025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:50:48,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:50:48,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 01:50:48,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862539317] [2022-07-23 01:50:48,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:50:48,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 01:50:48,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:50:48,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 01:50:48,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-23 01:50:48,083 INFO L87 Difference]: Start difference. First operand 71119 states and 106517 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (52), 10 states have call predecessors, (52), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-23 01:51:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:51:07,371 INFO L93 Difference]: Finished difference Result 183219 states and 290006 transitions. [2022-07-23 01:51:07,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 01:51:07,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (52), 10 states have call predecessors, (52), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 351 [2022-07-23 01:51:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 01:51:08,150 INFO L225 Difference]: With dead ends: 183219 [2022-07-23 01:51:08,150 INFO L226 Difference]: Without dead ends: 112120 [2022-07-23 01:51:08,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-07-23 01:51:08,529 INFO L413 NwaCegarLoop]: 2687 mSDtfsCounter, 3553 mSDsluCounter, 7708 mSDsCounter, 0 mSdLazyCounter, 6700 mSolverCounterSat, 2166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3909 SdHoareTripleChecker+Valid, 10395 SdHoareTripleChecker+Invalid, 8866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2166 IncrementalHoareTripleChecker+Valid, 6700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-23 01:51:08,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3909 Valid, 10395 Invalid, 8866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2166 Valid, 6700 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-07-23 01:51:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112120 states. [2022-07-23 01:51:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112120 to 77051. [2022-07-23 01:51:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77051 states, 53093 states have (on average 1.361290565611286) internal successors, (72275), 55347 states have internal predecessors, (72275), 19093 states have call successors, (19093), 4023 states have call predecessors, (19093), 4864 states have return successors, (27869), 18984 states have call predecessors, (27869), 19076 states have call successors, (27869) [2022-07-23 01:51:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77051 states to 77051 states and 119237 transitions. [2022-07-23 01:51:16,235 INFO L78 Accepts]: Start accepts. Automaton has 77051 states and 119237 transitions. Word has length 351 [2022-07-23 01:51:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 01:51:16,236 INFO L495 AbstractCegarLoop]: Abstraction has 77051 states and 119237 transitions. [2022-07-23 01:51:16,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (52), 10 states have call predecessors, (52), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-23 01:51:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 77051 states and 119237 transitions. [2022-07-23 01:51:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2022-07-23 01:51:16,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 01:51:16,253 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 01:51:16,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 01:51:16,254 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 01:51:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 01:51:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1571274942, now seen corresponding path program 1 times [2022-07-23 01:51:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 01:51:16,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44571241] [2022-07-23 01:51:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 01:51:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 01:51:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 01:51:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:51:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:51:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 01:51:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 01:51:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:51:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:51:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 01:51:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 01:51:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:51:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:51:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 01:51:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:51:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:51:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-23 01:51:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 01:51:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 01:51:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 01:51:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 01:51:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 01:51:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 01:51:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 01:51:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 01:51:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 01:51:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 01:51:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-23 01:51:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 01:51:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 01:51:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 01:51:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:51:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:51:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 01:51:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:51:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 01:51:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 01:51:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 01:51:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 01:51:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 01:51:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 01:51:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 01:51:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-23 01:51:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-23 01:51:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-23 01:51:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:16,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-23 01:51:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:51:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 01:51:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-23 01:51:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 01:51:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 01:51:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 01:51:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 01:51:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 01:51:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-23 01:51:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-23 01:51:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2022-07-23 01:51:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 01:51:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2022-07-23 01:51:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 01:51:17,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44571241] [2022-07-23 01:51:17,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44571241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 01:51:17,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 01:51:17,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-23 01:51:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907863411] [2022-07-23 01:51:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 01:51:17,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 01:51:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 01:51:17,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 01:51:17,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-23 01:51:17,082 INFO L87 Difference]: Start difference. First operand 77051 states and 119237 transitions. Second operand has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 5 states have internal predecessors, (171), 3 states have call successors, (54), 11 states have call predecessors, (54), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2022-07-23 01:51:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 01:51:47,078 INFO L93 Difference]: Finished difference Result 208149 states and 332235 transitions. [2022-07-23 01:51:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 01:51:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 5 states have internal predecessors, (171), 3 states have call successors, (54), 11 states have call predecessors, (54), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 391 [2022-07-23 01:51:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted.