./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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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--scsi--megaraid--megaraid_mm.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 34ead930b8137fdc7abb50622ed73bdb27f2c7ae71d0ef3b9d44cfc9bee95799 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 05:57:43,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 05:57:43,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 05:57:43,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 05:57:43,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 05:57:43,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 05:57:43,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 05:57:43,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 05:57:43,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 05:57:43,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 05:57:43,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 05:57:43,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 05:57:43,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 05:57:43,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 05:57:43,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 05:57:43,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 05:57:43,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 05:57:43,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 05:57:43,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 05:57:43,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 05:57:43,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 05:57:43,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 05:57:43,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 05:57:43,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 05:57:43,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 05:57:43,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 05:57:43,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 05:57:43,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 05:57:43,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 05:57:43,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 05:57:43,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 05:57:43,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 05:57:43,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 05:57:43,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 05:57:43,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 05:57:43,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 05:57:43,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 05:57:43,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 05:57:43,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 05:57:43,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 05:57:43,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 05:57:43,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 05:57:43,332 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 05:57:43,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 05:57:43,336 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 05:57:43,336 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 05:57:43,337 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 05:57:43,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 05:57:43,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 05:57:43,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 05:57:43,338 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 05:57:43,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 05:57:43,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 05:57:43,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 05:57:43,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 05:57:43,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 05:57:43,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 05:57:43,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 05:57:43,340 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 05:57:43,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 05:57:43,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 05:57:43,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 05:57:43,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 05:57:43,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 05:57:43,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 05:57:43,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 05:57:43,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 05:57:43,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 05:57:43,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 05:57:43,343 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 05:57:43,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 05:57:43,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 05:57:43,344 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 05:57:43,344 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 -> 34ead930b8137fdc7abb50622ed73bdb27f2c7ae71d0ef3b9d44cfc9bee95799 [2021-11-17 05:57:43,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 05:57:43,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 05:57:43,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 05:57:43,639 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 05:57:43,640 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 05:57:43,641 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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 05:57:43,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f1d4829e/9cc95905fb444aa2b1b66e8b16b55aa9/FLAG941d4d11b [2021-11-17 05:57:44,378 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 05:57:44,379 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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 05:57:44,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f1d4829e/9cc95905fb444aa2b1b66e8b16b55aa9/FLAG941d4d11b [2021-11-17 05:57:44,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f1d4829e/9cc95905fb444aa2b1b66e8b16b55aa9 [2021-11-17 05:57:44,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 05:57:44,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 05:57:44,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 05:57:44,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 05:57:44,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 05:57:44,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:57:44" (1/1) ... [2021-11-17 05:57:44,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745f1537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:44, skipping insertion in model container [2021-11-17 05:57:44,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:57:44" (1/1) ... [2021-11-17 05:57:44,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 05:57:44,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 05:57:45,570 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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[145794,145807] [2021-11-17 05:57:45,602 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 05:57:45,622 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 05:57:45,778 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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[145794,145807] [2021-11-17 05:57:45,784 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 05:57:45,813 INFO L208 MainTranslator]: Completed translation [2021-11-17 05:57:45,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45 WrapperNode [2021-11-17 05:57:45,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 05:57:45,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 05:57:45,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 05:57:45,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 05:57:45,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:45,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:45,940 INFO L137 Inliner]: procedures = 138, calls = 843, calls flagged for inlining = 61, calls inlined = 52, statements flattened = 1723 [2021-11-17 05:57:45,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 05:57:45,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 05:57:45,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 05:57:45,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 05:57:45,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:45,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:45,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:45,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:46,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:46,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:46,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:46,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 05:57:46,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 05:57:46,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 05:57:46,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 05:57:46,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (1/1) ... [2021-11-17 05:57:46,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 05:57:46,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:57:46,107 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) [2021-11-17 05:57:46,131 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 [2021-11-17 05:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 05:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 05:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 05:57:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 05:57:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 05:57:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 05:57:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 05:57:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 05:57:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2021-11-17 05:57:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2021-11-17 05:57:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 05:57:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 05:57:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_dealloc_kioc [2021-11-17 05:57:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_dealloc_kioc [2021-11-17 05:57:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 05:57:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 05:57:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_attach_buf [2021-11-17 05:57:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_attach_buf [2021-11-17 05:57:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2021-11-17 05:57:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2021-11-17 05:57:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 05:57:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2021-11-17 05:57:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2021-11-17 05:57:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 05:57:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 05:57:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 05:57:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 05:57:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 05:57:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 05:57:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_ioctl [2021-11-17 05:57:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_ioctl [2021-11-17 05:57:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-11-17 05:57:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-11-17 05:57:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 05:57:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 05:57:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 05:57:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2021-11-17 05:57:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2021-11-17 05:57:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2021-11-17 05:57:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2021-11-17 05:57:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-11-17 05:57:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-11-17 05:57:46,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 05:57:46,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 05:57:46,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 05:57:46,154 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 05:57:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 05:57:46,154 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-17 05:57:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2021-11-17 05:57:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2021-11-17 05:57:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure up [2021-11-17 05:57:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure up [2021-11-17 05:57:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 05:57:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-11-17 05:57:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-11-17 05:57:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2021-11-17 05:57:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2021-11-17 05:57:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 05:57:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 05:57:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2021-11-17 05:57:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2021-11-17 05:57:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 05:57:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 05:57:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 05:57:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 05:57:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure dma_pool_free [2021-11-17 05:57:46,159 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_pool_free [2021-11-17 05:57:46,501 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 05:57:46,503 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 05:57:46,701 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 05:57:47,907 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 05:57:47,928 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 05:57:47,929 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-17 05:57:47,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 05:57:47 BoogieIcfgContainer [2021-11-17 05:57:47,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 05:57:47,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 05:57:47,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 05:57:47,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 05:57:47,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:57:44" (1/3) ... [2021-11-17 05:57:47,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bbfd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:57:47, skipping insertion in model container [2021-11-17 05:57:47,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:57:45" (2/3) ... [2021-11-17 05:57:47,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bbfd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:57:47, skipping insertion in model container [2021-11-17 05:57:47,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 05:57:47" (3/3) ... [2021-11-17 05:57:47,940 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 05:57:47,944 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 05:57:47,944 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 05:57:47,992 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 05:57:48,001 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 05:57:48,001 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 05:57:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 403 states, 310 states have (on average 1.403225806451613) internal successors, (435), 318 states have internal predecessors, (435), 67 states have call successors, (67), 25 states have call predecessors, (67), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2021-11-17 05:57:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-17 05:57:48,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:57:48,057 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 05:57:48,058 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:57:48,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:57:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1253471979, now seen corresponding path program 1 times [2021-11-17 05:57:48,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:57:48,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683339913] [2021-11-17 05:57:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:57:48,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:57:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:57:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:57:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:57:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:57:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:57:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 05:57:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 05:57:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-17 05:57:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-17 05:57:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 05:57:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 05:57:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 05:57:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2021-11-17 05:57:48,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:57:48,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683339913] [2021-11-17 05:57:48,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683339913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:57:48,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 05:57:48,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 05:57:48,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206823803] [2021-11-17 05:57:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:57:48,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 05:57:48,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:57:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 05:57:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 05:57:48,809 INFO L87 Difference]: Start difference. First operand has 403 states, 310 states have (on average 1.403225806451613) internal successors, (435), 318 states have internal predecessors, (435), 67 states have call successors, (67), 25 states have call predecessors, (67), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 05:57:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:57:50,050 INFO L93 Difference]: Finished difference Result 815 states and 1172 transitions. [2021-11-17 05:57:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 05:57:50,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 174 [2021-11-17 05:57:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:57:50,064 INFO L225 Difference]: With dead ends: 815 [2021-11-17 05:57:50,065 INFO L226 Difference]: Without dead ends: 416 [2021-11-17 05:57:50,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 05:57:50,074 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 212 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-17 05:57:50,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 1113 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-17 05:57:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-11-17 05:57:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 387. [2021-11-17 05:57:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 299 states have (on average 1.3846153846153846) internal successors, (414), 302 states have internal predecessors, (414), 64 states have call successors, (64), 24 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2021-11-17 05:57:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 541 transitions. [2021-11-17 05:57:50,140 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 541 transitions. Word has length 174 [2021-11-17 05:57:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:57:50,141 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 541 transitions. [2021-11-17 05:57:50,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 05:57:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 541 transitions. [2021-11-17 05:57:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 05:57:50,148 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:57:50,148 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 05:57:50,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 05:57:50,149 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:57:50,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:57:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash -26593390, now seen corresponding path program 1 times [2021-11-17 05:57:50,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:57:50,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962977972] [2021-11-17 05:57:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:57:50,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:57:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:57:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:57:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:57:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:57:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:57:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 05:57:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-17 05:57:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 05:57:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 05:57:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-17 05:57:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 05:57:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 05:57:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2021-11-17 05:57:50,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:57:50,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962977972] [2021-11-17 05:57:50,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962977972] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:57:50,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 05:57:50,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 05:57:50,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528211694] [2021-11-17 05:57:50,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:57:50,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 05:57:50,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:57:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 05:57:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 05:57:50,404 INFO L87 Difference]: Start difference. First operand 387 states and 541 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 05:57:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:57:51,705 INFO L93 Difference]: Finished difference Result 818 states and 1156 transitions. [2021-11-17 05:57:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 05:57:51,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 175 [2021-11-17 05:57:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:57:51,716 INFO L225 Difference]: With dead ends: 818 [2021-11-17 05:57:51,716 INFO L226 Difference]: Without dead ends: 449 [2021-11-17 05:57:51,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 05:57:51,724 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 275 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 05:57:51,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 1477 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 05:57:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-17 05:57:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 414. [2021-11-17 05:57:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 323 states have (on average 1.3869969040247678) internal successors, (448), 326 states have internal predecessors, (448), 65 states have call successors, (65), 26 states have call predecessors, (65), 25 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2021-11-17 05:57:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 577 transitions. [2021-11-17 05:57:51,786 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 577 transitions. Word has length 175 [2021-11-17 05:57:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:57:51,788 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 577 transitions. [2021-11-17 05:57:51,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 05:57:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 577 transitions. [2021-11-17 05:57:51,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-11-17 05:57:51,793 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:57:51,794 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:57:51,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 05:57:51,794 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:57:51,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:57:51,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1359871746, now seen corresponding path program 1 times [2021-11-17 05:57:51,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:57:51,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966769043] [2021-11-17 05:57:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:57:51,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:57:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:57:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:51,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:57:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:51,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:51,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:57:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:57:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:51,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:57:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:57:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:57:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:57:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:57:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-17 05:57:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-17 05:57:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-11-17 05:57:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-11-17 05:57:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-17 05:57:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-11-17 05:57:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2021-11-17 05:57:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-17 05:57:52,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:57:52,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966769043] [2021-11-17 05:57:52,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966769043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:57:52,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 05:57:52,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 05:57:52,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231374521] [2021-11-17 05:57:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:57:52,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 05:57:52,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:57:52,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 05:57:52,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 05:57:52,158 INFO L87 Difference]: Start difference. First operand 414 states and 577 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 05:57:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:57:53,754 INFO L93 Difference]: Finished difference Result 885 states and 1249 transitions. [2021-11-17 05:57:53,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 05:57:53,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 225 [2021-11-17 05:57:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:57:53,758 INFO L225 Difference]: With dead ends: 885 [2021-11-17 05:57:53,758 INFO L226 Difference]: Without dead ends: 493 [2021-11-17 05:57:53,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-11-17 05:57:53,760 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 423 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-17 05:57:53,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 1550 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-17 05:57:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-11-17 05:57:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 456. [2021-11-17 05:57:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 361 states have (on average 1.3850415512465375) internal successors, (500), 364 states have internal predecessors, (500), 66 states have call successors, (66), 29 states have call predecessors, (66), 28 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-17 05:57:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 631 transitions. [2021-11-17 05:57:53,785 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 631 transitions. Word has length 225 [2021-11-17 05:57:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:57:53,786 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 631 transitions. [2021-11-17 05:57:53,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-17 05:57:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 631 transitions. [2021-11-17 05:57:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-11-17 05:57:53,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:57:53,790 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 05:57:53,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 05:57:53,791 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:57:53,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:57:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2071282825, now seen corresponding path program 1 times [2021-11-17 05:57:53,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:57:53,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326071417] [2021-11-17 05:57:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:57:53,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:57:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:57:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:57:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:57:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:57:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:57:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:53,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:57:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:57:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:57:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:57:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 05:57:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-11-17 05:57:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-17 05:57:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-17 05:57:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2021-11-17 05:57:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-17 05:57:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2021-11-17 05:57:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-11-17 05:57:54,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:57:54,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326071417] [2021-11-17 05:57:54,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326071417] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:57:54,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 05:57:54,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 05:57:54,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868286245] [2021-11-17 05:57:54,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:57:54,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 05:57:54,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:57:54,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 05:57:54,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 05:57:54,098 INFO L87 Difference]: Start difference. First operand 456 states and 631 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 05:57:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:57:55,602 INFO L93 Difference]: Finished difference Result 1039 states and 1467 transitions. [2021-11-17 05:57:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 05:57:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 243 [2021-11-17 05:57:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:57:55,606 INFO L225 Difference]: With dead ends: 1039 [2021-11-17 05:57:55,607 INFO L226 Difference]: Without dead ends: 605 [2021-11-17 05:57:55,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-17 05:57:55,609 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 357 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-17 05:57:55,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 2021 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-17 05:57:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-11-17 05:57:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 457. [2021-11-17 05:57:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 362 states have (on average 1.3839779005524862) internal successors, (501), 365 states have internal predecessors, (501), 66 states have call successors, (66), 29 states have call predecessors, (66), 28 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-17 05:57:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 632 transitions. [2021-11-17 05:57:55,629 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 632 transitions. Word has length 243 [2021-11-17 05:57:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:57:55,630 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 632 transitions. [2021-11-17 05:57:55,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 05:57:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 632 transitions. [2021-11-17 05:57:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-11-17 05:57:55,633 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:57:55,633 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 05:57:55,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 05:57:55,634 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:57:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:57:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1420447720, now seen corresponding path program 1 times [2021-11-17 05:57:55,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:57:55,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218621948] [2021-11-17 05:57:55,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:57:55,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:57:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:57:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:57:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:57:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:57:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:57:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:57:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:57:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:57:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:57:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 05:57:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 05:57:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 05:57:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-11-17 05:57:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-17 05:57:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-11-17 05:57:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-11-17 05:57:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-11-17 05:57:55,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:57:55,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218621948] [2021-11-17 05:57:55,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218621948] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:57:55,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 05:57:55,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 05:57:55,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972694071] [2021-11-17 05:57:55,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:57:55,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 05:57:55,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:57:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 05:57:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-17 05:57:55,956 INFO L87 Difference]: Start difference. First operand 457 states and 632 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 05:57:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:57:57,911 INFO L93 Difference]: Finished difference Result 930 states and 1303 transitions. [2021-11-17 05:57:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 05:57:57,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 239 [2021-11-17 05:57:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:57:57,914 INFO L225 Difference]: With dead ends: 930 [2021-11-17 05:57:57,914 INFO L226 Difference]: Without dead ends: 495 [2021-11-17 05:57:57,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-17 05:57:57,917 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 279 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-17 05:57:57,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 2195 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-17 05:57:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-11-17 05:57:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 459. [2021-11-17 05:57:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 364 states have (on average 1.3818681318681318) internal successors, (503), 367 states have internal predecessors, (503), 66 states have call successors, (66), 29 states have call predecessors, (66), 28 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-17 05:57:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 634 transitions. [2021-11-17 05:57:57,952 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 634 transitions. Word has length 239 [2021-11-17 05:57:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:57:57,952 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 634 transitions. [2021-11-17 05:57:57,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (23), 6 states have call predecessors, (23), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 05:57:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 634 transitions. [2021-11-17 05:57:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-11-17 05:57:57,957 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:57:57,957 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:57:57,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 05:57:57,957 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:57:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:57:57,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1997996134, now seen corresponding path program 1 times [2021-11-17 05:57:57,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:57:57,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023604741] [2021-11-17 05:57:57,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:57:57,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:57:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:57:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:57:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:57:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:57:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:57:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:57:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:57:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:57:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:57:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 05:57:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-11-17 05:57:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-17 05:57:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-17 05:57:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-11-17 05:57:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-17 05:57:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-11-17 05:57:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:57:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:57:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-17 05:57:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:57:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-17 05:57:58,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:57:58,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023604741] [2021-11-17 05:57:58,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023604741] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:57:58,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 05:57:58,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 05:57:58,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601986480] [2021-11-17 05:57:58,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:57:58,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 05:57:58,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:57:58,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 05:57:58,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-17 05:57:58,266 INFO L87 Difference]: Start difference. First operand 459 states and 634 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 05:58:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:00,589 INFO L93 Difference]: Finished difference Result 934 states and 1307 transitions. [2021-11-17 05:58:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 05:58:00,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 258 [2021-11-17 05:58:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:00,593 INFO L225 Difference]: With dead ends: 934 [2021-11-17 05:58:00,593 INFO L226 Difference]: Without dead ends: 497 [2021-11-17 05:58:00,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-17 05:58:00,596 INFO L933 BasicCegarLoop]: 515 mSDtfsCounter, 277 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:00,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 2448 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-17 05:58:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-11-17 05:58:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 459. [2021-11-17 05:58:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 364 states have (on average 1.3818681318681318) internal successors, (503), 367 states have internal predecessors, (503), 66 states have call successors, (66), 29 states have call predecessors, (66), 28 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-17 05:58:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 634 transitions. [2021-11-17 05:58:00,615 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 634 transitions. Word has length 258 [2021-11-17 05:58:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:00,615 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 634 transitions. [2021-11-17 05:58:00,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 05:58:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 634 transitions. [2021-11-17 05:58:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2021-11-17 05:58:00,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:00,620 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:00,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 05:58:00,620 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1119347117, now seen corresponding path program 1 times [2021-11-17 05:58:00,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:00,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569528141] [2021-11-17 05:58:00,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:00,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 05:58:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 05:58:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 05:58:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-17 05:58:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-11-17 05:58:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 05:58:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-11-17 05:58:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-11-17 05:58:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-11-17 05:58:00,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:00,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569528141] [2021-11-17 05:58:00,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569528141] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:58:00,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 05:58:00,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 05:58:00,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334661694] [2021-11-17 05:58:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:58:00,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 05:58:00,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 05:58:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 05:58:00,889 INFO L87 Difference]: Start difference. First operand 459 states and 634 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 05:58:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:02,658 INFO L93 Difference]: Finished difference Result 931 states and 1303 transitions. [2021-11-17 05:58:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 05:58:02,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 263 [2021-11-17 05:58:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:02,680 INFO L225 Difference]: With dead ends: 931 [2021-11-17 05:58:02,680 INFO L226 Difference]: Without dead ends: 494 [2021-11-17 05:58:02,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-17 05:58:02,682 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 342 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:02,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 1510 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-17 05:58:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-11-17 05:58:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 460. [2021-11-17 05:58:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 365 states have (on average 1.3808219178082193) internal successors, (504), 368 states have internal predecessors, (504), 66 states have call successors, (66), 29 states have call predecessors, (66), 28 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-17 05:58:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 635 transitions. [2021-11-17 05:58:02,697 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 635 transitions. Word has length 263 [2021-11-17 05:58:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:02,698 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 635 transitions. [2021-11-17 05:58:02,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 05:58:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 635 transitions. [2021-11-17 05:58:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2021-11-17 05:58:02,702 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:02,702 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:02,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 05:58:02,703 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1121162451, now seen corresponding path program 1 times [2021-11-17 05:58:02,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:02,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758047238] [2021-11-17 05:58:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:02,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 05:58:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 05:58:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 05:58:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-17 05:58:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-11-17 05:58:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 05:58:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-11-17 05:58:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-11-17 05:58:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-11-17 05:58:02,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:02,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758047238] [2021-11-17 05:58:02,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758047238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:58:02,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 05:58:02,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 05:58:02,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860235563] [2021-11-17 05:58:02,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:58:02,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 05:58:02,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:02,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 05:58:02,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 05:58:02,960 INFO L87 Difference]: Start difference. First operand 460 states and 635 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 05:58:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:05,177 INFO L93 Difference]: Finished difference Result 946 states and 1329 transitions. [2021-11-17 05:58:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 05:58:05,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 263 [2021-11-17 05:58:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:05,181 INFO L225 Difference]: With dead ends: 946 [2021-11-17 05:58:05,181 INFO L226 Difference]: Without dead ends: 508 [2021-11-17 05:58:05,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-17 05:58:05,183 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 291 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:05,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 2014 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-17 05:58:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-11-17 05:58:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 461. [2021-11-17 05:58:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 366 states have (on average 1.3797814207650274) internal successors, (505), 369 states have internal predecessors, (505), 66 states have call successors, (66), 29 states have call predecessors, (66), 28 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-17 05:58:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 636 transitions. [2021-11-17 05:58:05,199 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 636 transitions. Word has length 263 [2021-11-17 05:58:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:05,199 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 636 transitions. [2021-11-17 05:58:05,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 05:58:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 636 transitions. [2021-11-17 05:58:05,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2021-11-17 05:58:05,203 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:05,203 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:05,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 05:58:05,204 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:05,204 INFO L85 PathProgramCache]: Analyzing trace with hash -300906885, now seen corresponding path program 1 times [2021-11-17 05:58:05,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:05,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299142970] [2021-11-17 05:58:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:05,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 05:58:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-11-17 05:58:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 05:58:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-11-17 05:58:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-17 05:58:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-11-17 05:58:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-11-17 05:58:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-11-17 05:58:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-17 05:58:05,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:05,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299142970] [2021-11-17 05:58:05,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299142970] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:05,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27760356] [2021-11-17 05:58:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:05,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:05,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:05,463 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) [2021-11-17 05:58:05,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 05:58:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:05,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 2173 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 05:58:05,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-11-17 05:58:06,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 05:58:06,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27760356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:58:06,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 05:58:06,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2021-11-17 05:58:06,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961348785] [2021-11-17 05:58:06,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:58:06,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 05:58:06,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:06,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 05:58:06,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-17 05:58:06,400 INFO L87 Difference]: Start difference. First operand 461 states and 636 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 05:58:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:06,422 INFO L93 Difference]: Finished difference Result 908 states and 1264 transitions. [2021-11-17 05:58:06,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 05:58:06,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 263 [2021-11-17 05:58:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:06,426 INFO L225 Difference]: With dead ends: 908 [2021-11-17 05:58:06,426 INFO L226 Difference]: Without dead ends: 469 [2021-11-17 05:58:06,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-17 05:58:06,430 INFO L933 BasicCegarLoop]: 539 mSDtfsCounter, 3 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:06,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1074 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 05:58:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-11-17 05:58:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467. [2021-11-17 05:58:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 372 states have (on average 1.3790322580645162) internal successors, (513), 375 states have internal predecessors, (513), 66 states have call successors, (66), 29 states have call predecessors, (66), 28 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-17 05:58:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 644 transitions. [2021-11-17 05:58:06,443 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 644 transitions. Word has length 263 [2021-11-17 05:58:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:06,444 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 644 transitions. [2021-11-17 05:58:06,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-17 05:58:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 644 transitions. [2021-11-17 05:58:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2021-11-17 05:58:06,447 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:06,447 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:06,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:06,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:06,664 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash 136138233, now seen corresponding path program 1 times [2021-11-17 05:58:06,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:06,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778985936] [2021-11-17 05:58:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:06,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 05:58:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 05:58:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 05:58:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-17 05:58:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-11-17 05:58:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 05:58:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-11-17 05:58:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-17 05:58:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-11-17 05:58:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-17 05:58:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-17 05:58:06,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:06,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778985936] [2021-11-17 05:58:06,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778985936] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:06,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005935245] [2021-11-17 05:58:06,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:06,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:06,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:06,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:06,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-17 05:58:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:07,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 2256 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 05:58:07,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-11-17 05:58:08,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 05:58:08,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005935245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:58:08,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 05:58:08,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-11-17 05:58:08,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450853654] [2021-11-17 05:58:08,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:58:08,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 05:58:08,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:08,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 05:58:08,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-17 05:58:08,032 INFO L87 Difference]: Start difference. First operand 467 states and 644 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 05:58:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:08,117 INFO L93 Difference]: Finished difference Result 915 states and 1265 transitions. [2021-11-17 05:58:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 05:58:08,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 281 [2021-11-17 05:58:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:08,120 INFO L225 Difference]: With dead ends: 915 [2021-11-17 05:58:08,120 INFO L226 Difference]: Without dead ends: 465 [2021-11-17 05:58:08,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-17 05:58:08,122 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 7 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:08,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 2144 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 05:58:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-11-17 05:58:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2021-11-17 05:58:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 370 states have (on average 1.3756756756756756) internal successors, (509), 373 states have internal predecessors, (509), 66 states have call successors, (66), 29 states have call predecessors, (66), 28 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-17 05:58:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 640 transitions. [2021-11-17 05:58:08,137 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 640 transitions. Word has length 281 [2021-11-17 05:58:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:08,137 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 640 transitions. [2021-11-17 05:58:08,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 05:58:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 640 transitions. [2021-11-17 05:58:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2021-11-17 05:58:08,140 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:08,140 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:08,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:08,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-17 05:58:08,368 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1511044386, now seen corresponding path program 1 times [2021-11-17 05:58:08,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:08,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160443185] [2021-11-17 05:58:08,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:08,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 05:58:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 05:58:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 05:58:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 05:58:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-11-17 05:58:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 05:58:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-17 05:58:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-11-17 05:58:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-11-17 05:58:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-17 05:58:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-11-17 05:58:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-17 05:58:08,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:08,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160443185] [2021-11-17 05:58:08,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160443185] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:08,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514966316] [2021-11-17 05:58:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:08,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:08,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:08,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:08,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-17 05:58:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:09,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 2302 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 05:58:09,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-11-17 05:58:09,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 05:58:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-17 05:58:09,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514966316] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 05:58:09,944 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 05:58:09,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2021-11-17 05:58:09,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768291097] [2021-11-17 05:58:09,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 05:58:09,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 05:58:09,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 05:58:09,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-17 05:58:09,947 INFO L87 Difference]: Start difference. First operand 465 states and 640 transitions. Second operand has 11 states, 11 states have (on average 14.181818181818182) internal successors, (156), 7 states have internal predecessors, (156), 5 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2021-11-17 05:58:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:11,599 INFO L93 Difference]: Finished difference Result 990 states and 1394 transitions. [2021-11-17 05:58:11,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 05:58:11,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.181818181818182) internal successors, (156), 7 states have internal predecessors, (156), 5 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) Word has length 285 [2021-11-17 05:58:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:11,604 INFO L225 Difference]: With dead ends: 990 [2021-11-17 05:58:11,604 INFO L226 Difference]: Without dead ends: 547 [2021-11-17 05:58:11,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-11-17 05:58:11,606 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 359 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:11,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 1854 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-17 05:58:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-11-17 05:58:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 504. [2021-11-17 05:58:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 403 states have (on average 1.369727047146402) internal successors, (552), 408 states have internal predecessors, (552), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2021-11-17 05:58:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 695 transitions. [2021-11-17 05:58:11,623 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 695 transitions. Word has length 285 [2021-11-17 05:58:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:11,623 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 695 transitions. [2021-11-17 05:58:11,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.181818181818182) internal successors, (156), 7 states have internal predecessors, (156), 5 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2021-11-17 05:58:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 695 transitions. [2021-11-17 05:58:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-11-17 05:58:11,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:11,627 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:11,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:11,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:11,861 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash -819478165, now seen corresponding path program 1 times [2021-11-17 05:58:11,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:11,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798527262] [2021-11-17 05:58:11,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:11,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 05:58:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-17 05:58:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-11-17 05:58:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 05:58:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-11-17 05:58:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 05:58:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-17 05:58:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-11-17 05:58:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-17 05:58:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-17 05:58:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-17 05:58:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-17 05:58:12,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:12,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798527262] [2021-11-17 05:58:12,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798527262] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:12,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324791275] [2021-11-17 05:58:12,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:12,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:12,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:12,264 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:12,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-17 05:58:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:12,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 2330 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-17 05:58:12,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-11-17 05:58:13,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 05:58:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-17 05:58:13,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324791275] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 05:58:13,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 05:58:13,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 12 [2021-11-17 05:58:13,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966089562] [2021-11-17 05:58:13,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 05:58:13,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-17 05:58:13,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:13,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-17 05:58:13,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-11-17 05:58:13,668 INFO L87 Difference]: Start difference. First operand 504 states and 695 transitions. Second operand has 12 states, 12 states have (on average 13.0) internal successors, (156), 8 states have internal predecessors, (156), 3 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-17 05:58:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:16,486 INFO L93 Difference]: Finished difference Result 1048 states and 1474 transitions. [2021-11-17 05:58:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 05:58:16,487 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.0) internal successors, (156), 8 states have internal predecessors, (156), 3 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 297 [2021-11-17 05:58:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:16,491 INFO L225 Difference]: With dead ends: 1048 [2021-11-17 05:58:16,491 INFO L226 Difference]: Without dead ends: 566 [2021-11-17 05:58:16,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2021-11-17 05:58:16,493 INFO L933 BasicCegarLoop]: 534 mSDtfsCounter, 368 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 2951 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:16,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 2951 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-17 05:58:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-11-17 05:58:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 518. [2021-11-17 05:58:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 415 states have (on average 1.3686746987951808) internal successors, (568), 421 states have internal predecessors, (568), 74 states have call successors, (74), 29 states have call predecessors, (74), 28 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2021-11-17 05:58:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 715 transitions. [2021-11-17 05:58:16,509 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 715 transitions. Word has length 297 [2021-11-17 05:58:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:16,509 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 715 transitions. [2021-11-17 05:58:16,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.0) internal successors, (156), 8 states have internal predecessors, (156), 3 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-17 05:58:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 715 transitions. [2021-11-17 05:58:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-11-17 05:58:16,512 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:16,513 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-17 05:58:16,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:16,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:16,727 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:16,728 INFO L85 PathProgramCache]: Analyzing trace with hash 84366775, now seen corresponding path program 1 times [2021-11-17 05:58:16,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:16,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787336659] [2021-11-17 05:58:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:16,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:16,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 05:58:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 05:58:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-17 05:58:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 05:58:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-17 05:58:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-11-17 05:58:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 05:58:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-11-17 05:58:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-17 05:58:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-17 05:58:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-17 05:58:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-17 05:58:17,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:17,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787336659] [2021-11-17 05:58:17,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787336659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:58:17,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 05:58:17,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 05:58:17,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093226930] [2021-11-17 05:58:17,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:58:17,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 05:58:17,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:17,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 05:58:17,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 05:58:17,070 INFO L87 Difference]: Start difference. First operand 518 states and 715 transitions. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 05:58:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:18,179 INFO L93 Difference]: Finished difference Result 1046 states and 1460 transitions. [2021-11-17 05:58:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 05:58:18,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 297 [2021-11-17 05:58:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:18,182 INFO L225 Difference]: With dead ends: 1046 [2021-11-17 05:58:18,183 INFO L226 Difference]: Without dead ends: 550 [2021-11-17 05:58:18,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-17 05:58:18,185 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 341 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:18,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 1499 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-17 05:58:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-11-17 05:58:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 520. [2021-11-17 05:58:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 417 states have (on average 1.3669064748201438) internal successors, (570), 423 states have internal predecessors, (570), 74 states have call successors, (74), 29 states have call predecessors, (74), 28 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2021-11-17 05:58:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 717 transitions. [2021-11-17 05:58:18,201 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 717 transitions. Word has length 297 [2021-11-17 05:58:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:18,201 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 717 transitions. [2021-11-17 05:58:18,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 05:58:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 717 transitions. [2021-11-17 05:58:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2021-11-17 05:58:18,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:18,205 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:18,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 05:58:18,205 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:18,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:18,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1867758490, now seen corresponding path program 1 times [2021-11-17 05:58:18,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:18,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896419050] [2021-11-17 05:58:18,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:18,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 05:58:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 05:58:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-11-17 05:58:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-17 05:58:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-11-17 05:58:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-11-17 05:58:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-17 05:58:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-11-17 05:58:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2021-11-17 05:58:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-11-17 05:58:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-11-17 05:58:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-17 05:58:18,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:18,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896419050] [2021-11-17 05:58:18,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896419050] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:18,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376533612] [2021-11-17 05:58:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:18,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:18,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:18,504 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:18,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-17 05:58:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 2328 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-17 05:58:19,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-17 05:58:19,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 05:58:19,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376533612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:58:19,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 05:58:19,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-11-17 05:58:19,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417527652] [2021-11-17 05:58:19,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:58:19,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 05:58:19,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:19,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 05:58:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-17 05:58:19,474 INFO L87 Difference]: Start difference. First operand 520 states and 717 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 05:58:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:19,510 INFO L93 Difference]: Finished difference Result 1022 states and 1415 transitions. [2021-11-17 05:58:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 05:58:19,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 299 [2021-11-17 05:58:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:19,518 INFO L225 Difference]: With dead ends: 1022 [2021-11-17 05:58:19,518 INFO L226 Difference]: Without dead ends: 524 [2021-11-17 05:58:19,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-17 05:58:19,520 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 5 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:19,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1603 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 05:58:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-11-17 05:58:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 522. [2021-11-17 05:58:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 419 states have (on average 1.3651551312649164) internal successors, (572), 425 states have internal predecessors, (572), 74 states have call successors, (74), 29 states have call predecessors, (74), 28 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2021-11-17 05:58:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 719 transitions. [2021-11-17 05:58:19,535 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 719 transitions. Word has length 299 [2021-11-17 05:58:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:19,535 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 719 transitions. [2021-11-17 05:58:19,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 05:58:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 719 transitions. [2021-11-17 05:58:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-11-17 05:58:19,539 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:19,539 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:19,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:19,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-17 05:58:19,768 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:19,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:19,768 INFO L85 PathProgramCache]: Analyzing trace with hash -316021051, now seen corresponding path program 1 times [2021-11-17 05:58:19,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:19,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302822977] [2021-11-17 05:58:19,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:19,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 05:58:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 05:58:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-11-17 05:58:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-17 05:58:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-11-17 05:58:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2021-11-17 05:58:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-11-17 05:58:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2021-11-17 05:58:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-11-17 05:58:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2021-11-17 05:58:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-11-17 05:58:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-17 05:58:20,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:20,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302822977] [2021-11-17 05:58:20,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302822977] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:20,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791926345] [2021-11-17 05:58:20,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:20,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:20,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:20,083 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:20,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-17 05:58:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:20,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 2354 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-17 05:58:20,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-17 05:58:21,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 05:58:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-17 05:58:21,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791926345] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 05:58:21,648 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 05:58:21,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2021-11-17 05:58:21,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954652230] [2021-11-17 05:58:21,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 05:58:21,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 05:58:21,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:21,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 05:58:21,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-17 05:58:21,650 INFO L87 Difference]: Start difference. First operand 522 states and 719 transitions. Second operand has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2021-11-17 05:58:23,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 05:58:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:23,941 INFO L93 Difference]: Finished difference Result 1058 states and 1474 transitions. [2021-11-17 05:58:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 05:58:23,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 305 [2021-11-17 05:58:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:23,945 INFO L225 Difference]: With dead ends: 1058 [2021-11-17 05:58:23,945 INFO L226 Difference]: Without dead ends: 558 [2021-11-17 05:58:23,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-11-17 05:58:23,950 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 344 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:23,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 2387 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-17 05:58:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-11-17 05:58:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 528. [2021-11-17 05:58:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 425 states have (on average 1.36) internal successors, (578), 431 states have internal predecessors, (578), 74 states have call successors, (74), 29 states have call predecessors, (74), 28 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2021-11-17 05:58:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 725 transitions. [2021-11-17 05:58:23,966 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 725 transitions. Word has length 305 [2021-11-17 05:58:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:23,967 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 725 transitions. [2021-11-17 05:58:23,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2021-11-17 05:58:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 725 transitions. [2021-11-17 05:58:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2021-11-17 05:58:23,970 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:23,970 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-17 05:58:24,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:24,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-17 05:58:24,184 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:24,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash 433160894, now seen corresponding path program 1 times [2021-11-17 05:58:24,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:24,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678910865] [2021-11-17 05:58:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:24,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 05:58:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 05:58:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-11-17 05:58:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-11-17 05:58:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 05:58:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-11-17 05:58:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-11-17 05:58:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-17 05:58:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-17 05:58:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-11-17 05:58:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-11-17 05:58:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-17 05:58:24,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:24,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678910865] [2021-11-17 05:58:24,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678910865] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:24,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578136342] [2021-11-17 05:58:24,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:24,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:24,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:24,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:24,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-17 05:58:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:25,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 2361 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 05:58:25,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2021-11-17 05:58:25,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 05:58:25,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578136342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:58:25,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 05:58:25,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2021-11-17 05:58:25,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847450264] [2021-11-17 05:58:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:58:25,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 05:58:25,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 05:58:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-17 05:58:25,577 INFO L87 Difference]: Start difference. First operand 528 states and 725 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 05:58:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:25,601 INFO L93 Difference]: Finished difference Result 1037 states and 1430 transitions. [2021-11-17 05:58:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 05:58:25,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 308 [2021-11-17 05:58:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:25,605 INFO L225 Difference]: With dead ends: 1037 [2021-11-17 05:58:25,605 INFO L226 Difference]: Without dead ends: 531 [2021-11-17 05:58:25,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-17 05:58:25,607 INFO L933 BasicCegarLoop]: 539 mSDtfsCounter, 2 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:25,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1073 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 05:58:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-11-17 05:58:25,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2021-11-17 05:58:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 426 states have (on average 1.3591549295774648) internal successors, (579), 432 states have internal predecessors, (579), 74 states have call successors, (74), 29 states have call predecessors, (74), 28 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2021-11-17 05:58:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 726 transitions. [2021-11-17 05:58:25,621 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 726 transitions. Word has length 308 [2021-11-17 05:58:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:25,622 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 726 transitions. [2021-11-17 05:58:25,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 05:58:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 726 transitions. [2021-11-17 05:58:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2021-11-17 05:58:25,625 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:25,625 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-17 05:58:25,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:25,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:25,848 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1631255998, now seen corresponding path program 1 times [2021-11-17 05:58:25,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:25,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445266648] [2021-11-17 05:58:25,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:25,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 05:58:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-17 05:58:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-11-17 05:58:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-11-17 05:58:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 05:58:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-11-17 05:58:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-11-17 05:58:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-17 05:58:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-17 05:58:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-11-17 05:58:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-11-17 05:58:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-17 05:58:26,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:26,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445266648] [2021-11-17 05:58:26,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445266648] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:26,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196764085] [2021-11-17 05:58:26,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:26,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:26,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:26,159 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:26,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-17 05:58:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:26,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 2362 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-17 05:58:26,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-17 05:58:27,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 05:58:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-11-17 05:58:28,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196764085] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 05:58:28,060 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 05:58:28,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2021-11-17 05:58:28,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603466560] [2021-11-17 05:58:28,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 05:58:28,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-17 05:58:28,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:28,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-17 05:58:28,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-17 05:58:28,063 INFO L87 Difference]: Start difference. First operand 529 states and 726 transitions. Second operand has 17 states, 17 states have (on average 10.588235294117647) internal successors, (180), 13 states have internal predecessors, (180), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2021-11-17 05:58:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:30,406 INFO L93 Difference]: Finished difference Result 1078 states and 1497 transitions. [2021-11-17 05:58:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 05:58:30,407 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.588235294117647) internal successors, (180), 13 states have internal predecessors, (180), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 308 [2021-11-17 05:58:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:30,409 INFO L225 Difference]: With dead ends: 1078 [2021-11-17 05:58:30,409 INFO L226 Difference]: Without dead ends: 571 [2021-11-17 05:58:30,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 678 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2021-11-17 05:58:30,411 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 284 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 3962 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:30,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 3962 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-17 05:58:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-11-17 05:58:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 541. [2021-11-17 05:58:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 438 states have (on average 1.3493150684931507) internal successors, (591), 444 states have internal predecessors, (591), 74 states have call successors, (74), 29 states have call predecessors, (74), 28 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2021-11-17 05:58:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 738 transitions. [2021-11-17 05:58:30,426 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 738 transitions. Word has length 308 [2021-11-17 05:58:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:30,426 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 738 transitions. [2021-11-17 05:58:30,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.588235294117647) internal successors, (180), 13 states have internal predecessors, (180), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2021-11-17 05:58:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 738 transitions. [2021-11-17 05:58:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2021-11-17 05:58:30,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:30,430 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:30,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:30,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-17 05:58:30,643 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:30,644 INFO L85 PathProgramCache]: Analyzing trace with hash -618188491, now seen corresponding path program 1 times [2021-11-17 05:58:30,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:30,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665238356] [2021-11-17 05:58:30,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:30,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 05:58:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 05:58:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-17 05:58:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 05:58:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 05:58:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-17 05:58:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 05:58:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:30,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-11-17 05:58:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-17 05:58:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-11-17 05:58:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2021-11-17 05:58:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-11-17 05:58:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-11-17 05:58:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-11-17 05:58:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-11-17 05:58:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-11-17 05:58:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-11-17 05:58:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-11-17 05:58:31,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:31,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665238356] [2021-11-17 05:58:31,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665238356] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:31,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241999124] [2021-11-17 05:58:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:31,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:31,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:31,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:31,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-17 05:58:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:32,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-17 05:58:32,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-11-17 05:58:32,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 05:58:32,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241999124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 05:58:32,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 05:58:32,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2021-11-17 05:58:32,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947544037] [2021-11-17 05:58:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 05:58:32,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 05:58:32,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 05:58:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-11-17 05:58:32,663 INFO L87 Difference]: Start difference. First operand 541 states and 738 transitions. Second operand has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-17 05:58:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:32,760 INFO L93 Difference]: Finished difference Result 1087 states and 1489 transitions. [2021-11-17 05:58:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 05:58:32,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) Word has length 324 [2021-11-17 05:58:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:32,764 INFO L225 Difference]: With dead ends: 1087 [2021-11-17 05:58:32,764 INFO L226 Difference]: Without dead ends: 543 [2021-11-17 05:58:32,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2021-11-17 05:58:32,766 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 6 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:32,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 2627 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 05:58:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-11-17 05:58:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2021-11-17 05:58:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 440 states have (on average 1.3477272727272727) internal successors, (593), 446 states have internal predecessors, (593), 74 states have call successors, (74), 29 states have call predecessors, (74), 28 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2021-11-17 05:58:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 740 transitions. [2021-11-17 05:58:32,782 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 740 transitions. Word has length 324 [2021-11-17 05:58:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:32,783 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 740 transitions. [2021-11-17 05:58:32,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-17 05:58:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 740 transitions. [2021-11-17 05:58:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2021-11-17 05:58:32,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:32,786 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-17 05:58:32,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:32,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-17 05:58:33,000 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1544908096, now seen corresponding path program 1 times [2021-11-17 05:58:33,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:33,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79160347] [2021-11-17 05:58:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:33,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 05:58:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-17 05:58:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-17 05:58:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 05:58:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 05:58:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 05:58:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-17 05:58:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-17 05:58:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-11-17 05:58:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-17 05:58:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2021-11-17 05:58:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-11-17 05:58:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-11-17 05:58:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-17 05:58:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-11-17 05:58:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-17 05:58:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-17 05:58:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-11-17 05:58:33,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:33,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79160347] [2021-11-17 05:58:33,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79160347] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:33,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731717499] [2021-11-17 05:58:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:33,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:33,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:33,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:33,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-17 05:58:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:34,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 2434 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-17 05:58:34,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2021-11-17 05:58:35,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 05:58:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2021-11-17 05:58:35,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731717499] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 05:58:35,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 05:58:35,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 26 [2021-11-17 05:58:35,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197012914] [2021-11-17 05:58:35,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 05:58:35,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-17 05:58:35,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-17 05:58:35,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2021-11-17 05:58:35,770 INFO L87 Difference]: Start difference. First operand 543 states and 740 transitions. Second operand has 26 states, 24 states have (on average 10.541666666666666) internal successors, (253), 22 states have internal predecessors, (253), 4 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2021-11-17 05:58:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:38,240 INFO L93 Difference]: Finished difference Result 1119 states and 1538 transitions. [2021-11-17 05:58:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-17 05:58:38,241 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 10.541666666666666) internal successors, (253), 22 states have internal predecessors, (253), 4 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 325 [2021-11-17 05:58:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:38,243 INFO L225 Difference]: With dead ends: 1119 [2021-11-17 05:58:38,243 INFO L226 Difference]: Without dead ends: 573 [2021-11-17 05:58:38,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=2115, Unknown=0, NotChecked=0, Total=2352 [2021-11-17 05:58:38,246 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 289 mSDsluCounter, 5750 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 6262 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:38,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 6262 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-17 05:58:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-11-17 05:58:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 552. [2021-11-17 05:58:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 447 states have (on average 1.342281879194631) internal successors, (600), 453 states have internal predecessors, (600), 75 states have call successors, (75), 30 states have call predecessors, (75), 29 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2021-11-17 05:58:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 749 transitions. [2021-11-17 05:58:38,262 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 749 transitions. Word has length 325 [2021-11-17 05:58:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:38,262 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 749 transitions. [2021-11-17 05:58:38,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 10.541666666666666) internal successors, (253), 22 states have internal predecessors, (253), 4 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2021-11-17 05:58:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 749 transitions. [2021-11-17 05:58:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2021-11-17 05:58:38,266 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:38,266 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:38,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:38,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:38,491 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:38,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:38,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2037762750, now seen corresponding path program 1 times [2021-11-17 05:58:38,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:38,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728932029] [2021-11-17 05:58:38,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:38,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 05:58:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-17 05:58:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 05:58:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 05:58:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-17 05:58:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-17 05:58:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 05:58:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-11-17 05:58:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-17 05:58:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-17 05:58:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-11-17 05:58:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-11-17 05:58:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-17 05:58:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-17 05:58:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2021-11-17 05:58:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-17 05:58:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-11-17 05:58:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2021-11-17 05:58:38,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:38,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728932029] [2021-11-17 05:58:38,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728932029] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:38,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213776178] [2021-11-17 05:58:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:38,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:38,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:38,984 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:39,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-17 05:58:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:42,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 2504 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-17 05:58:42,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2021-11-17 05:58:43,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 05:58:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2021-11-17 05:58:43,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213776178] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 05:58:43,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 05:58:43,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 29 [2021-11-17 05:58:43,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004867448] [2021-11-17 05:58:43,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 05:58:43,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-17 05:58:43,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:43,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-17 05:58:43,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-11-17 05:58:43,917 INFO L87 Difference]: Start difference. First operand 552 states and 749 transitions. Second operand has 29 states, 27 states have (on average 9.777777777777779) internal successors, (264), 25 states have internal predecessors, (264), 4 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2021-11-17 05:58:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:47,303 INFO L93 Difference]: Finished difference Result 1135 states and 1553 transitions. [2021-11-17 05:58:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-17 05:58:47,304 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 9.777777777777779) internal successors, (264), 25 states have internal predecessors, (264), 4 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 339 [2021-11-17 05:58:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:47,307 INFO L225 Difference]: With dead ends: 1135 [2021-11-17 05:58:47,307 INFO L226 Difference]: Without dead ends: 577 [2021-11-17 05:58:47,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=2600, Unknown=0, NotChecked=0, Total=2862 [2021-11-17 05:58:47,310 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 289 mSDsluCounter, 8189 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 8702 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:47,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 8702 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-17 05:58:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-11-17 05:58:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 556. [2021-11-17 05:58:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 451 states have (on average 1.3392461197339247) internal successors, (604), 457 states have internal predecessors, (604), 75 states have call successors, (75), 30 states have call predecessors, (75), 29 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2021-11-17 05:58:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 753 transitions. [2021-11-17 05:58:47,326 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 753 transitions. Word has length 339 [2021-11-17 05:58:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:47,326 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 753 transitions. [2021-11-17 05:58:47,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 9.777777777777779) internal successors, (264), 25 states have internal predecessors, (264), 4 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2021-11-17 05:58:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 753 transitions. [2021-11-17 05:58:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2021-11-17 05:58:47,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:47,330 INFO L514 BasicCegarLoop]: trace histogram [15, 13, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:58:47,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:47,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:47,555 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1317664203, now seen corresponding path program 1 times [2021-11-17 05:58:47,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:47,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169167772] [2021-11-17 05:58:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:47,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 05:58:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-17 05:58:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 05:58:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 05:58:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 05:58:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 05:58:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 05:58:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-11-17 05:58:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-11-17 05:58:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-11-17 05:58:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:47,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-11-17 05:58:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-11-17 05:58:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-11-17 05:58:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-11-17 05:58:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-11-17 05:58:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-11-17 05:58:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-17 05:58:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2021-11-17 05:58:48,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:48,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169167772] [2021-11-17 05:58:48,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169167772] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:48,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547507452] [2021-11-17 05:58:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:48,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:48,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:48,044 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:48,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-17 05:58:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:51,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-17 05:58:51,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:58:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 96 proven. 6 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2021-11-17 05:58:52,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 05:58:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2021-11-17 05:58:53,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547507452] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 05:58:53,265 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 05:58:53,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 32 [2021-11-17 05:58:53,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051198170] [2021-11-17 05:58:53,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 05:58:53,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-17 05:58:53,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:58:53,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-17 05:58:53,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2021-11-17 05:58:53,267 INFO L87 Difference]: Start difference. First operand 556 states and 753 transitions. Second operand has 32 states, 30 states have (on average 8.833333333333334) internal successors, (265), 28 states have internal predecessors, (265), 4 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2021-11-17 05:58:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:58:55,483 INFO L93 Difference]: Finished difference Result 1143 states and 1561 transitions. [2021-11-17 05:58:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-17 05:58:55,483 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 8.833333333333334) internal successors, (265), 28 states have internal predecessors, (265), 4 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 343 [2021-11-17 05:58:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:58:55,485 INFO L225 Difference]: With dead ends: 1143 [2021-11-17 05:58:55,486 INFO L226 Difference]: Without dead ends: 581 [2021-11-17 05:58:55,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=283, Invalid=3257, Unknown=0, NotChecked=0, Total=3540 [2021-11-17 05:58:55,488 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 356 mSDsluCounter, 5114 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 5626 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-17 05:58:55,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 5626 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-17 05:58:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-11-17 05:58:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 560. [2021-11-17 05:58:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 455 states have (on average 1.3362637362637362) internal successors, (608), 461 states have internal predecessors, (608), 75 states have call successors, (75), 30 states have call predecessors, (75), 29 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2021-11-17 05:58:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 757 transitions. [2021-11-17 05:58:55,504 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 757 transitions. Word has length 343 [2021-11-17 05:58:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:58:55,505 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 757 transitions. [2021-11-17 05:58:55,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 8.833333333333334) internal successors, (265), 28 states have internal predecessors, (265), 4 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2021-11-17 05:58:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 757 transitions. [2021-11-17 05:58:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2021-11-17 05:58:55,508 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:58:55,508 INFO L514 BasicCegarLoop]: trace histogram [20, 14, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-17 05:58:55,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-17 05:58:55,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-17 05:58:55,724 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:58:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:58:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash 589972497, now seen corresponding path program 2 times [2021-11-17 05:58:55,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:58:55,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908435405] [2021-11-17 05:58:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:58:55,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:58:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:58:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 05:58:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 05:58:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 05:58:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 05:58:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 05:58:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 05:58:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:58:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 05:58:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-17 05:58:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-11-17 05:58:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-11-17 05:58:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-17 05:58:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-11-17 05:58:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-17 05:58:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-11-17 05:58:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:58:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:58:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-11-17 05:58:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-11-17 05:58:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-17 05:58:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:58:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-11-17 05:58:56,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:58:56,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908435405] [2021-11-17 05:58:56,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908435405] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:58:56,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638347067] [2021-11-17 05:58:56,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 05:58:56,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:58:56,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:58:56,232 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:58:56,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-17 05:59:34,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 05:59:34,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 05:59:34,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-17 05:59:34,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 05:59:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 213 proven. 31 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2021-11-17 05:59:35,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 05:59:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 31 proven. 103 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2021-11-17 05:59:36,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638347067] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 05:59:36,235 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 05:59:36,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 35 [2021-11-17 05:59:36,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18851991] [2021-11-17 05:59:36,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 05:59:36,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-17 05:59:36,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 05:59:36,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-17 05:59:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2021-11-17 05:59:36,236 INFO L87 Difference]: Start difference. First operand 560 states and 757 transitions. Second operand has 35 states, 33 states have (on average 8.030303030303031) internal successors, (265), 31 states have internal predecessors, (265), 4 states have call successors, (66), 6 states have call predecessors, (66), 5 states have return successors, (55), 4 states have call predecessors, (55), 4 states have call successors, (55) [2021-11-17 05:59:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 05:59:40,406 INFO L93 Difference]: Finished difference Result 1154 states and 1574 transitions. [2021-11-17 05:59:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-17 05:59:40,406 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 8.030303030303031) internal successors, (265), 31 states have internal predecessors, (265), 4 states have call successors, (66), 6 states have call predecessors, (66), 5 states have return successors, (55), 4 states have call predecessors, (55), 4 states have call successors, (55) Word has length 346 [2021-11-17 05:59:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 05:59:40,410 INFO L225 Difference]: With dead ends: 1154 [2021-11-17 05:59:40,410 INFO L226 Difference]: Without dead ends: 593 [2021-11-17 05:59:40,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=4323, Unknown=0, NotChecked=0, Total=4692 [2021-11-17 05:59:40,414 INFO L933 BasicCegarLoop]: 511 mSDtfsCounter, 307 mSDsluCounter, 6979 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 7490 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-17 05:59:40,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 7490 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-11-17 05:59:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-11-17 05:59:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 572. [2021-11-17 05:59:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 466 states have (on average 1.3304721030042919) internal successors, (620), 472 states have internal predecessors, (620), 75 states have call successors, (75), 31 states have call predecessors, (75), 30 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2021-11-17 05:59:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 769 transitions. [2021-11-17 05:59:40,435 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 769 transitions. Word has length 346 [2021-11-17 05:59:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 05:59:40,435 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 769 transitions. [2021-11-17 05:59:40,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 8.030303030303031) internal successors, (265), 31 states have internal predecessors, (265), 4 states have call successors, (66), 6 states have call predecessors, (66), 5 states have return successors, (55), 4 states have call predecessors, (55), 4 states have call successors, (55) [2021-11-17 05:59:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 769 transitions. [2021-11-17 05:59:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2021-11-17 05:59:40,439 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 05:59:40,439 INFO L514 BasicCegarLoop]: trace histogram [23, 15, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 05:59:40,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-17 05:59:40,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-17 05:59:40,661 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 05:59:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 05:59:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash -230718135, now seen corresponding path program 2 times [2021-11-17 05:59:40,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 05:59:40,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769138304] [2021-11-17 05:59:40,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 05:59:40,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 05:59:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 05:59:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-17 05:59:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 05:59:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 05:59:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-17 05:59:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 05:59:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:59:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-17 05:59:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 05:59:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-17 05:59:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 05:59:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:59:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 05:59:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:59:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-17 05:59:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:59:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-11-17 05:59:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-11-17 05:59:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-11-17 05:59:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2021-11-17 05:59:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 05:59:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 05:59:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-11-17 05:59:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-11-17 05:59:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-11-17 05:59:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 05:59:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2021-11-17 05:59:41,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 05:59:41,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769138304] [2021-11-17 05:59:41,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769138304] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 05:59:41,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23320859] [2021-11-17 05:59:41,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 05:59:41,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 05:59:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 05:59:41,254 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 05:59:41,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-17 06:00:15,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 06:00:15,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 06:00:15,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 2603 conjuncts, 149 conjunts are in the unsatisfiable core [2021-11-17 06:00:15,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:00:15,904 INFO L354 Elim1Store]: treesize reduction 1002, result has 4.4 percent of original size [2021-11-17 06:00:15,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 18 case distinctions, treesize of input 183 treesize of output 192 [2021-11-17 06:00:15,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 174 [2021-11-17 06:00:17,871 INFO L354 Elim1Store]: treesize reduction 1764, result has 13.3 percent of original size [2021-11-17 06:00:17,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 123 case distinctions, treesize of input 254 treesize of output 481 [2021-11-17 06:00:24,306 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-17 06:00:24,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-11-17 06:00:24,307 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-11-17 06:00:24,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-17 06:00:24,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-17 06:00:24,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763872785] [2021-11-17 06:00:24,308 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-17 06:00:24,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-17 06:00:24,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 06:00:24,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-17 06:00:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-11-17 06:00:24,309 INFO L87 Difference]: Start difference. First operand 572 states and 769 transitions. Second operand has 21 states, 21 states have (on average 7.904761904761905) internal successors, (166), 17 states have internal predecessors, (166), 2 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-17 06:00:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-17 06:00:24,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-11-17 06:00:24,310 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 06:00:24,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 06:00:24,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-17 06:00:24,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 06:00:24,512 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@654c8ab4 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-17 06:00:24,515 INFO L158 Benchmark]: Toolchain (without parser) took 159812.23ms. Allocated memory was 96.5MB in the beginning and 383.8MB in the end (delta: 287.3MB). Free memory was 59.7MB in the beginning and 112.2MB in the end (delta: -52.5MB). Peak memory consumption was 235.3MB. Max. memory is 16.1GB. [2021-11-17 06:00:24,515 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 54.3MB in the beginning and 54.3MB in the end (delta: 42.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 06:00:24,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1108.78ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 59.5MB in the beginning and 54.7MB in the end (delta: 4.8MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2021-11-17 06:00:24,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.42ms. Allocated memory is still 125.8MB. Free memory was 54.1MB in the beginning and 82.5MB in the end (delta: -28.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-11-17 06:00:24,516 INFO L158 Benchmark]: Boogie Preprocessor took 132.75ms. Allocated memory is still 125.8MB. Free memory was 82.5MB in the beginning and 72.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-17 06:00:24,516 INFO L158 Benchmark]: RCFGBuilder took 1856.32ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 72.7MB in the beginning and 124.6MB in the end (delta: -51.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2021-11-17 06:00:24,516 INFO L158 Benchmark]: TraceAbstraction took 156581.79ms. Allocated memory was 172.0MB in the beginning and 383.8MB in the end (delta: 211.8MB). Free memory was 123.6MB in the beginning and 112.2MB in the end (delta: 11.3MB). Peak memory consumption was 224.2MB. Max. memory is 16.1GB. [2021-11-17 06:00:24,517 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 54.3MB in the beginning and 54.3MB in the end (delta: 42.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1108.78ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 59.5MB in the beginning and 54.7MB in the end (delta: 4.8MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.42ms. Allocated memory is still 125.8MB. Free memory was 54.1MB in the beginning and 82.5MB in the end (delta: -28.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.75ms. Allocated memory is still 125.8MB. Free memory was 82.5MB in the beginning and 72.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1856.32ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 72.7MB in the beginning and 124.6MB in the end (delta: -51.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * TraceAbstraction took 156581.79ms. Allocated memory was 172.0MB in the beginning and 383.8MB in the end (delta: 211.8MB). Free memory was 123.6MB in the beginning and 112.2MB in the end (delta: 11.3MB). Peak memory consumption was 224.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@654c8ab4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@654c8ab4: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 34ead930b8137fdc7abb50622ed73bdb27f2c7ae71d0ef3b9d44cfc9bee95799 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 06:00:26,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 06:00:26,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 06:00:26,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 06:00:26,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 06:00:26,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 06:00:26,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 06:00:26,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 06:00:26,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 06:00:26,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 06:00:26,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 06:00:26,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 06:00:26,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 06:00:26,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 06:00:26,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 06:00:26,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 06:00:26,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 06:00:26,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 06:00:26,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 06:00:26,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 06:00:26,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 06:00:26,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 06:00:26,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 06:00:26,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 06:00:26,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 06:00:26,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 06:00:26,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 06:00:26,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 06:00:26,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 06:00:26,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 06:00:26,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 06:00:26,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 06:00:26,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 06:00:26,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 06:00:26,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 06:00:26,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 06:00:26,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 06:00:26,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 06:00:26,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 06:00:26,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 06:00:26,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 06:00:26,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-17 06:00:26,440 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 06:00:26,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 06:00:26,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 06:00:26,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 06:00:26,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 06:00:26,443 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 06:00:26,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 06:00:26,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 06:00:26,444 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 06:00:26,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 06:00:26,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 06:00:26,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 06:00:26,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 06:00:26,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 06:00:26,446 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-17 06:00:26,446 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-17 06:00:26,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 06:00:26,446 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 06:00:26,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 06:00:26,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 06:00:26,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 06:00:26,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 06:00:26,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 06:00:26,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 06:00:26,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 06:00:26,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 06:00:26,460 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-17 06:00:26,460 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-17 06:00:26,460 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 06:00:26,460 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 06:00:26,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 06:00:26,461 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 06:00:26,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-17 06:00:26,461 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 34ead930b8137fdc7abb50622ed73bdb27f2c7ae71d0ef3b9d44cfc9bee95799 [2021-11-17 06:00:26,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 06:00:26,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 06:00:26,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 06:00:26,766 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 06:00:26,767 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 06:00:26,768 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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 06:00:26,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476e99571/98d1494b11f445faa3c6244876797bba/FLAG84bf3020f [2021-11-17 06:00:27,447 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 06:00:27,448 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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 06:00:27,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476e99571/98d1494b11f445faa3c6244876797bba/FLAG84bf3020f [2021-11-17 06:00:27,645 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476e99571/98d1494b11f445faa3c6244876797bba [2021-11-17 06:00:27,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 06:00:27,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 06:00:27,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 06:00:27,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 06:00:27,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 06:00:27,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:00:27" (1/1) ... [2021-11-17 06:00:27,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee5316c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:27, skipping insertion in model container [2021-11-17 06:00:27,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:00:27" (1/1) ... [2021-11-17 06:00:27,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 06:00:27,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 06:00:28,540 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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[145794,145807] [2021-11-17 06:00:28,596 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 06:00:28,645 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 06:00:28,847 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--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i[145794,145807] [2021-11-17 06:00:28,858 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 06:00:28,911 INFO L208 MainTranslator]: Completed translation [2021-11-17 06:00:28,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28 WrapperNode [2021-11-17 06:00:28,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 06:00:28,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 06:00:28,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 06:00:28,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 06:00:28,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:28,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:29,049 INFO L137 Inliner]: procedures = 153, calls = 843, calls flagged for inlining = 61, calls inlined = 52, statements flattened = 1684 [2021-11-17 06:00:29,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 06:00:29,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 06:00:29,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 06:00:29,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 06:00:29,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:29,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:29,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:29,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:29,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:29,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:29,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:29,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 06:00:29,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 06:00:29,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 06:00:29,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 06:00:29,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (1/1) ... [2021-11-17 06:00:29,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 06:00:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 06:00:29,201 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) [2021-11-17 06:00:29,233 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 [2021-11-17 06:00:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-17 06:00:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-17 06:00:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-17 06:00:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 06:00:29,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-17 06:00:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 06:00:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 06:00:29,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 06:00:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 06:00:29,248 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 06:00:29,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2021-11-17 06:00:29,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2021-11-17 06:00:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 06:00:29,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 06:00:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_dealloc_kioc [2021-11-17 06:00:29,249 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_dealloc_kioc [2021-11-17 06:00:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 06:00:29,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 06:00:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_attach_buf [2021-11-17 06:00:29,250 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_attach_buf [2021-11-17 06:00:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2021-11-17 06:00:29,250 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2021-11-17 06:00:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2021-11-17 06:00:29,250 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2021-11-17 06:00:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 06:00:29,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 06:00:29,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-17 06:00:29,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-17 06:00:29,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-17 06:00:29,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-17 06:00:29,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 06:00:29,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 06:00:29,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 06:00:29,252 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 06:00:29,252 INFO L130 BoogieDeclarations]: Found specification of procedure mraid_mm_ioctl [2021-11-17 06:00:29,252 INFO L138 BoogieDeclarations]: Found implementation of procedure mraid_mm_ioctl [2021-11-17 06:00:29,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-11-17 06:00:29,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-11-17 06:00:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 06:00:29,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 06:00:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 06:00:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2021-11-17 06:00:29,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2021-11-17 06:00:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2021-11-17 06:00:29,254 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2021-11-17 06:00:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-11-17 06:00:29,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-11-17 06:00:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 06:00:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 06:00:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 06:00:29,255 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 06:00:29,255 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 06:00:29,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-17 06:00:29,255 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-17 06:00:29,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-17 06:00:29,256 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2021-11-17 06:00:29,257 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2021-11-17 06:00:29,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-17 06:00:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure up [2021-11-17 06:00:29,258 INFO L138 BoogieDeclarations]: Found implementation of procedure up [2021-11-17 06:00:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 06:00:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-11-17 06:00:29,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-11-17 06:00:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2021-11-17 06:00:29,259 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2021-11-17 06:00:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-17 06:00:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-17 06:00:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-17 06:00:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 06:00:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-17 06:00:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 06:00:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-17 06:00:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-17 06:00:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-17 06:00:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-17 06:00:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2021-11-17 06:00:29,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2021-11-17 06:00:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-17 06:00:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 06:00:29,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 06:00:29,286 INFO L130 BoogieDeclarations]: Found specification of procedure dma_pool_free [2021-11-17 06:00:29,286 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_pool_free [2021-11-17 06:00:29,659 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 06:00:29,661 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 06:00:29,748 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 06:00:38,195 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 06:00:38,204 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 06:00:38,204 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-17 06:00:38,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:00:38 BoogieIcfgContainer [2021-11-17 06:00:38,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 06:00:38,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 06:00:38,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 06:00:38,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 06:00:38,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:00:27" (1/3) ... [2021-11-17 06:00:38,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc7d21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:00:38, skipping insertion in model container [2021-11-17 06:00:38,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:00:28" (2/3) ... [2021-11-17 06:00:38,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc7d21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:00:38, skipping insertion in model container [2021-11-17 06:00:38,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:00:38" (3/3) ... [2021-11-17 06:00:38,213 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--megaraid--megaraid_mm.ko-entry_point.cil.out.i [2021-11-17 06:00:38,218 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 06:00:38,218 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 06:00:38,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 06:00:38,261 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 06:00:38,262 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 06:00:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 403 states, 310 states have (on average 1.403225806451613) internal successors, (435), 318 states have internal predecessors, (435), 67 states have call successors, (67), 25 states have call predecessors, (67), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2021-11-17 06:00:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-17 06:00:38,302 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:00:38,303 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 06:00:38,303 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:00:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:00:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 698284012, now seen corresponding path program 1 times [2021-11-17 06:00:38,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:00:38,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121746714] [2021-11-17 06:00:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:00:38,322 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:00:38,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:00:38,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:00:38,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-17 06:00:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:00:39,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-17 06:00:39,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:00:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2021-11-17 06:00:39,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:00:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2021-11-17 06:00:40,153 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:00:40,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121746714] [2021-11-17 06:00:40,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121746714] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:00:40,154 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:00:40,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-17 06:00:40,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067686168] [2021-11-17 06:00:40,156 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:00:40,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-17 06:00:40,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:00:40,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-17 06:00:40,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-17 06:00:40,197 INFO L87 Difference]: Start difference. First operand has 403 states, 310 states have (on average 1.403225806451613) internal successors, (435), 318 states have internal predecessors, (435), 67 states have call successors, (67), 25 states have call predecessors, (67), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 06:00:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:00:40,286 INFO L93 Difference]: Finished difference Result 786 states and 1119 transitions. [2021-11-17 06:00:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-17 06:00:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 174 [2021-11-17 06:00:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:00:40,300 INFO L225 Difference]: With dead ends: 786 [2021-11-17 06:00:40,300 INFO L226 Difference]: Without dead ends: 387 [2021-11-17 06:00:40,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-17 06:00:40,310 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 06:00:40,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 06:00:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-11-17 06:00:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2021-11-17 06:00:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 299 states have (on average 1.3846153846153846) internal successors, (414), 302 states have internal predecessors, (414), 64 states have call successors, (64), 24 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2021-11-17 06:00:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 541 transitions. [2021-11-17 06:00:40,374 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 541 transitions. Word has length 174 [2021-11-17 06:00:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:00:40,375 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 541 transitions. [2021-11-17 06:00:40,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-17 06:00:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 541 transitions. [2021-11-17 06:00:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-17 06:00:40,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:00:40,380 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 06:00:40,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-17 06:00:40,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:00:40,600 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:00:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:00:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash 944989674, now seen corresponding path program 1 times [2021-11-17 06:00:40,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:00:40,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567744862] [2021-11-17 06:00:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:00:40,602 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:00:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:00:40,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:00:40,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-17 06:00:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:00:41,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-17 06:00:41,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:00:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-17 06:00:42,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:00:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-11-17 06:00:42,894 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:00:42,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567744862] [2021-11-17 06:00:42,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567744862] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 06:00:42,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 06:00:42,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2021-11-17 06:00:42,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221883906] [2021-11-17 06:00:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 06:00:42,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 06:00:42,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:00:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 06:00:42,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-17 06:00:42,898 INFO L87 Difference]: Start difference. First operand 387 states and 541 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-17 06:00:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:00:43,214 INFO L93 Difference]: Finished difference Result 776 states and 1092 transitions. [2021-11-17 06:00:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 06:00:43,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 175 [2021-11-17 06:00:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:00:43,219 INFO L225 Difference]: With dead ends: 776 [2021-11-17 06:00:43,219 INFO L226 Difference]: Without dead ends: 388 [2021-11-17 06:00:43,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-17 06:00:43,223 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 6 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 06:00:43,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 2647 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 06:00:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-17 06:00:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2021-11-17 06:00:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 300 states have (on average 1.3833333333333333) internal successors, (415), 303 states have internal predecessors, (415), 64 states have call successors, (64), 24 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2021-11-17 06:00:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 542 transitions. [2021-11-17 06:00:43,248 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 542 transitions. Word has length 175 [2021-11-17 06:00:43,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:00:43,248 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 542 transitions. [2021-11-17 06:00:43,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-17 06:00:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 542 transitions. [2021-11-17 06:00:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-17 06:00:43,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:00:43,251 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 06:00:43,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-17 06:00:43,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:00:43,472 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:00:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:00:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash -462479994, now seen corresponding path program 1 times [2021-11-17 06:00:43,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:00:43,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472699455] [2021-11-17 06:00:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:00:43,474 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:00:43,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:00:43,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:00:43,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-17 06:00:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:00:44,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-17 06:00:44,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:00:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-11-17 06:00:45,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:00:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-11-17 06:00:45,950 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:00:45,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472699455] [2021-11-17 06:00:45,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472699455] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:00:45,951 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:00:45,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-11-17 06:00:45,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408926624] [2021-11-17 06:00:45,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:00:45,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-17 06:00:45,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:00:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-17 06:00:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-17 06:00:45,954 INFO L87 Difference]: Start difference. First operand 388 states and 542 transitions. Second operand has 11 states, 9 states have (on average 13.222222222222221) internal successors, (119), 11 states have internal predecessors, (119), 4 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2021-11-17 06:00:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:00:46,373 INFO L93 Difference]: Finished difference Result 783 states and 1100 transitions. [2021-11-17 06:00:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 06:00:46,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 13.222222222222221) internal successors, (119), 11 states have internal predecessors, (119), 4 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 180 [2021-11-17 06:00:46,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:00:46,377 INFO L225 Difference]: With dead ends: 783 [2021-11-17 06:00:46,377 INFO L226 Difference]: Without dead ends: 394 [2021-11-17 06:00:46,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-17 06:00:46,380 INFO L933 BasicCegarLoop]: 534 mSDtfsCounter, 10 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3704 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 06:00:46,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 3704 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 06:00:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-17 06:00:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2021-11-17 06:00:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 304 states have (on average 1.3782894736842106) internal successors, (419), 307 states have internal predecessors, (419), 65 states have call successors, (65), 25 states have call predecessors, (65), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2021-11-17 06:00:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 548 transitions. [2021-11-17 06:00:46,403 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 548 transitions. Word has length 180 [2021-11-17 06:00:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:00:46,403 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 548 transitions. [2021-11-17 06:00:46,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 13.222222222222221) internal successors, (119), 11 states have internal predecessors, (119), 4 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2021-11-17 06:00:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 548 transitions. [2021-11-17 06:00:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-11-17 06:00:46,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:00:46,411 INFO L514 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 06:00:46,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-17 06:00:46,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:00:46,628 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:00:46,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:00:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 246407799, now seen corresponding path program 1 times [2021-11-17 06:00:46,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:00:46,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221190662] [2021-11-17 06:00:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:00:46,631 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:00:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:00:46,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:00:46,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-17 06:00:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:00:47,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-17 06:00:47,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:00:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-11-17 06:00:48,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:00:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-11-17 06:00:49,137 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:00:49,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221190662] [2021-11-17 06:00:49,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221190662] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:00:49,137 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:00:49,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-11-17 06:00:49,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672496983] [2021-11-17 06:00:49,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:00:49,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-17 06:00:49,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:00:49,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-17 06:00:49,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-17 06:00:49,140 INFO L87 Difference]: Start difference. First operand 394 states and 548 transitions. Second operand has 13 states, 11 states have (on average 11.363636363636363) internal successors, (125), 13 states have internal predecessors, (125), 4 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2021-11-17 06:00:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:00:49,634 INFO L93 Difference]: Finished difference Result 793 states and 1109 transitions. [2021-11-17 06:00:49,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 06:00:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 11.363636363636363) internal successors, (125), 13 states have internal predecessors, (125), 4 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 189 [2021-11-17 06:00:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:00:49,638 INFO L225 Difference]: With dead ends: 793 [2021-11-17 06:00:49,638 INFO L226 Difference]: Without dead ends: 395 [2021-11-17 06:00:49,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-11-17 06:00:49,650 INFO L933 BasicCegarLoop]: 534 mSDtfsCounter, 9 mSDsluCounter, 3711 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 06:00:49,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 4245 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 06:00:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-11-17 06:00:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2021-11-17 06:00:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 305 states have (on average 1.3770491803278688) internal successors, (420), 308 states have internal predecessors, (420), 65 states have call successors, (65), 25 states have call predecessors, (65), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2021-11-17 06:00:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 549 transitions. [2021-11-17 06:00:49,673 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 549 transitions. Word has length 189 [2021-11-17 06:00:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:00:49,674 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 549 transitions. [2021-11-17 06:00:49,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 11.363636363636363) internal successors, (125), 13 states have internal predecessors, (125), 4 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2021-11-17 06:00:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 549 transitions. [2021-11-17 06:00:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-11-17 06:00:49,677 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:00:49,678 INFO L514 BasicCegarLoop]: trace histogram [15, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 06:00:49,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-17 06:00:49,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:00:49,891 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:00:49,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:00:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 274012102, now seen corresponding path program 2 times [2021-11-17 06:00:49,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:00:49,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227913589] [2021-11-17 06:00:49,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 06:00:49,894 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:00:49,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:00:49,906 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:00:49,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-17 06:00:50,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 06:00:50,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 06:00:50,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 06:00:50,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:00:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2021-11-17 06:00:50,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:00:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2021-11-17 06:00:51,053 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:00:51,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227913589] [2021-11-17 06:00:51,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227913589] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:00:51,053 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:00:51,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 06:00:51,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530538556] [2021-11-17 06:00:51,054 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:00:51,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 06:00:51,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:00:51,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 06:00:51,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:00:51,055 INFO L87 Difference]: Start difference. First operand 395 states and 549 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 06:00:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:00:51,098 INFO L93 Difference]: Finished difference Result 768 states and 1074 transitions. [2021-11-17 06:00:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 06:00:51,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 190 [2021-11-17 06:00:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:00:51,104 INFO L225 Difference]: With dead ends: 768 [2021-11-17 06:00:51,104 INFO L226 Difference]: Without dead ends: 396 [2021-11-17 06:00:51,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:00:51,106 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 0 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 06:00:51,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1075 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 06:00:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-17 06:00:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2021-11-17 06:00:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 306 states have (on average 1.3758169934640523) internal successors, (421), 309 states have internal predecessors, (421), 65 states have call successors, (65), 25 states have call predecessors, (65), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2021-11-17 06:00:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 550 transitions. [2021-11-17 06:00:51,122 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 550 transitions. Word has length 190 [2021-11-17 06:00:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:00:51,123 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 550 transitions. [2021-11-17 06:00:51,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 06:00:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 550 transitions. [2021-11-17 06:00:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-17 06:00:51,126 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:00:51,126 INFO L514 BasicCegarLoop]: trace histogram [15, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 06:00:51,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-17 06:00:51,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:00:51,343 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:00:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:00:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1020381717, now seen corresponding path program 1 times [2021-11-17 06:00:51,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:00:51,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315145337] [2021-11-17 06:00:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:00:51,345 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:00:51,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:00:51,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:00:51,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-17 06:00:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:00:52,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-17 06:00:52,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:00:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 96 proven. 6 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2021-11-17 06:00:52,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:00:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2021-11-17 06:00:53,800 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:00:53,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315145337] [2021-11-17 06:00:53,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315145337] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:00:53,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:00:53,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-11-17 06:00:53,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337171731] [2021-11-17 06:00:53,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:00:53,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-17 06:00:53,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:00:53,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-17 06:00:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-17 06:00:53,802 INFO L87 Difference]: Start difference. First operand 396 states and 550 transitions. Second operand has 15 states, 13 states have (on average 9.76923076923077) internal successors, (127), 15 states have internal predecessors, (127), 4 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2021-11-17 06:00:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:00:54,450 INFO L93 Difference]: Finished difference Result 797 states and 1113 transitions. [2021-11-17 06:00:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 06:00:54,451 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.76923076923077) internal successors, (127), 15 states have internal predecessors, (127), 4 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 194 [2021-11-17 06:00:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:00:54,453 INFO L225 Difference]: With dead ends: 797 [2021-11-17 06:00:54,453 INFO L226 Difference]: Without dead ends: 397 [2021-11-17 06:00:54,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-11-17 06:00:54,456 INFO L933 BasicCegarLoop]: 534 mSDtfsCounter, 16 mSDsluCounter, 3716 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4250 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-17 06:00:54,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 4250 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-17 06:00:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-11-17 06:00:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2021-11-17 06:00:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 307 states have (on average 1.3745928338762214) internal successors, (422), 310 states have internal predecessors, (422), 65 states have call successors, (65), 25 states have call predecessors, (65), 24 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2021-11-17 06:00:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 551 transitions. [2021-11-17 06:00:54,469 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 551 transitions. Word has length 194 [2021-11-17 06:00:54,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:00:54,469 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 551 transitions. [2021-11-17 06:00:54,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.76923076923077) internal successors, (127), 15 states have internal predecessors, (127), 4 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2021-11-17 06:00:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 551 transitions. [2021-11-17 06:00:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-17 06:00:54,472 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:00:54,472 INFO L514 BasicCegarLoop]: trace histogram [20, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 06:00:54,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-17 06:00:54,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:00:54,687 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:00:54,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:00:54,688 INFO L85 PathProgramCache]: Analyzing trace with hash -430252822, now seen corresponding path program 1 times [2021-11-17 06:00:54,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:00:54,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451036453] [2021-11-17 06:00:54,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:00:54,689 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:00:54,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:00:54,691 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:00:54,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-17 06:00:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:00:55,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-17 06:00:55,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:00:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 229 proven. 10 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-11-17 06:00:55,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:00:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 31 proven. 103 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2021-11-17 06:00:57,289 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:00:57,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451036453] [2021-11-17 06:00:57,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451036453] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:00:57,290 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:00:57,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-11-17 06:00:57,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684074825] [2021-11-17 06:00:57,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:00:57,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-17 06:00:57,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:00:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-17 06:00:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-11-17 06:00:57,292 INFO L87 Difference]: Start difference. First operand 397 states and 551 transitions. Second operand has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 17 states have internal predecessors, (125), 4 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-17 06:00:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:00:58,119 INFO L93 Difference]: Finished difference Result 802 states and 1120 transitions. [2021-11-17 06:00:58,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 06:00:58,120 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 17 states have internal predecessors, (125), 4 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 195 [2021-11-17 06:00:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:00:58,123 INFO L225 Difference]: With dead ends: 802 [2021-11-17 06:00:58,123 INFO L226 Difference]: Without dead ends: 406 [2021-11-17 06:00:58,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2021-11-17 06:00:58,125 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 23 mSDsluCounter, 5295 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 5828 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 06:00:58,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 5828 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 06:00:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-17 06:00:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2021-11-17 06:00:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 315 states have (on average 1.3682539682539683) internal successors, (431), 318 states have internal predecessors, (431), 65 states have call successors, (65), 26 states have call predecessors, (65), 25 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2021-11-17 06:00:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 560 transitions. [2021-11-17 06:00:58,139 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 560 transitions. Word has length 195 [2021-11-17 06:00:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:00:58,139 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 560 transitions. [2021-11-17 06:00:58,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.333333333333334) internal successors, (125), 17 states have internal predecessors, (125), 4 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-17 06:00:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 560 transitions. [2021-11-17 06:00:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-11-17 06:00:58,142 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:00:58,142 INFO L514 BasicCegarLoop]: trace histogram [23, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 06:00:58,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-17 06:00:58,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:00:58,363 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:00:58,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:00:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1360371765, now seen corresponding path program 2 times [2021-11-17 06:00:58,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:00:58,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554929957] [2021-11-17 06:00:58,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 06:00:58,365 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:00:58,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:00:58,367 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:00:58,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-17 06:00:58,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 06:00:58,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 06:00:58,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 06:00:58,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:00:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2021-11-17 06:00:59,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:00:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2021-11-17 06:00:59,537 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:00:59,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554929957] [2021-11-17 06:00:59,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554929957] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:00:59,538 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:00:59,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 06:00:59,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945122602] [2021-11-17 06:00:59,538 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:00:59,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 06:00:59,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:00:59,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 06:00:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 06:00:59,539 INFO L87 Difference]: Start difference. First operand 406 states and 560 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 06:01:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:00,512 INFO L93 Difference]: Finished difference Result 799 states and 1119 transitions. [2021-11-17 06:01:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 06:01:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 202 [2021-11-17 06:01:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:00,520 INFO L225 Difference]: With dead ends: 799 [2021-11-17 06:01:00,520 INFO L226 Difference]: Without dead ends: 422 [2021-11-17 06:01:00,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 06:01:00,524 INFO L933 BasicCegarLoop]: 550 mSDtfsCounter, 22 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:00,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1619 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-17 06:01:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-11-17 06:01:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 416. [2021-11-17 06:01:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 323 states have (on average 1.368421052631579) internal successors, (442), 327 states have internal predecessors, (442), 67 states have call successors, (67), 26 states have call predecessors, (67), 25 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 06:01:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 575 transitions. [2021-11-17 06:01:00,542 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 575 transitions. Word has length 202 [2021-11-17 06:01:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:00,543 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 575 transitions. [2021-11-17 06:01:00,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 06:01:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 575 transitions. [2021-11-17 06:01:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-17 06:01:00,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:00,547 INFO L514 BasicCegarLoop]: trace histogram [23, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 06:01:00,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:00,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:00,766 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash -581865830, now seen corresponding path program 1 times [2021-11-17 06:01:00,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:00,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388623643] [2021-11-17 06:01:00,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:00,768 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:00,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:00,769 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:00,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-17 06:01:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:01,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-17 06:01:01,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 271 proven. 15 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2021-11-17 06:01:02,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 36 proven. 135 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2021-11-17 06:01:03,945 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:03,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388623643] [2021-11-17 06:01:03,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388623643] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:01:03,945 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:01:03,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-11-17 06:01:03,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063535952] [2021-11-17 06:01:03,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:01:03,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-17 06:01:03,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:03,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-17 06:01:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-11-17 06:01:03,947 INFO L87 Difference]: Start difference. First operand 416 states and 575 transitions. Second operand has 19 states, 17 states have (on average 7.705882352941177) internal successors, (131), 19 states have internal predecessors, (131), 4 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-17 06:01:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:04,861 INFO L93 Difference]: Finished difference Result 832 states and 1155 transitions. [2021-11-17 06:01:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-17 06:01:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.705882352941177) internal successors, (131), 19 states have internal predecessors, (131), 4 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 206 [2021-11-17 06:01:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:04,865 INFO L225 Difference]: With dead ends: 832 [2021-11-17 06:01:04,865 INFO L226 Difference]: Without dead ends: 417 [2021-11-17 06:01:04,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2021-11-17 06:01:04,869 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 34 mSDsluCounter, 4765 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 5298 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:04,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 5298 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-17 06:01:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2021-11-17 06:01:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2021-11-17 06:01:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 324 states have (on average 1.367283950617284) internal successors, (443), 328 states have internal predecessors, (443), 67 states have call successors, (67), 26 states have call predecessors, (67), 25 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 06:01:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 576 transitions. [2021-11-17 06:01:04,883 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 576 transitions. Word has length 206 [2021-11-17 06:01:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:04,883 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 576 transitions. [2021-11-17 06:01:04,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.705882352941177) internal successors, (131), 19 states have internal predecessors, (131), 4 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-17 06:01:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 576 transitions. [2021-11-17 06:01:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-17 06:01:04,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:04,886 INFO L514 BasicCegarLoop]: trace histogram [26, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 06:01:04,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:05,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:05,108 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1776122837, now seen corresponding path program 1 times [2021-11-17 06:01:05,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:05,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990581821] [2021-11-17 06:01:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:05,109 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:05,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:05,110 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:05,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-17 06:01:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:05,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-17 06:01:05,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 317 proven. 21 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-11-17 06:01:06,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 41 proven. 172 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2021-11-17 06:01:08,717 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:08,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990581821] [2021-11-17 06:01:08,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990581821] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:01:08,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:01:08,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-11-17 06:01:08,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828827629] [2021-11-17 06:01:08,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:01:08,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-17 06:01:08,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:08,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-17 06:01:08,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-11-17 06:01:08,719 INFO L87 Difference]: Start difference. First operand 417 states and 576 transitions. Second operand has 21 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 21 states have internal predecessors, (137), 4 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-17 06:01:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:09,708 INFO L93 Difference]: Finished difference Result 834 states and 1157 transitions. [2021-11-17 06:01:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-17 06:01:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 21 states have internal predecessors, (137), 4 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 213 [2021-11-17 06:01:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:09,711 INFO L225 Difference]: With dead ends: 834 [2021-11-17 06:01:09,711 INFO L226 Difference]: Without dead ends: 418 [2021-11-17 06:01:09,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2021-11-17 06:01:09,714 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 35 mSDsluCounter, 5828 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 6361 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:09,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 6361 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-17 06:01:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-11-17 06:01:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2021-11-17 06:01:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 325 states have (on average 1.366153846153846) internal successors, (444), 329 states have internal predecessors, (444), 67 states have call successors, (67), 26 states have call predecessors, (67), 25 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 06:01:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 577 transitions. [2021-11-17 06:01:09,728 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 577 transitions. Word has length 213 [2021-11-17 06:01:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:09,728 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 577 transitions. [2021-11-17 06:01:09,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 21 states have internal predecessors, (137), 4 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-17 06:01:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 577 transitions. [2021-11-17 06:01:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2021-11-17 06:01:09,731 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:09,731 INFO L514 BasicCegarLoop]: trace histogram [29, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 06:01:09,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:09,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:09,945 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1724962775, now seen corresponding path program 2 times [2021-11-17 06:01:09,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:09,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816487468] [2021-11-17 06:01:09,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 06:01:09,947 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:09,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:09,948 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:09,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-17 06:01:10,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 06:01:10,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 06:01:10,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 06:01:10,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2021-11-17 06:01:10,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2021-11-17 06:01:11,187 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:11,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816487468] [2021-11-17 06:01:11,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816487468] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:01:11,188 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:01:11,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 06:01:11,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28523291] [2021-11-17 06:01:11,188 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:01:11,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 06:01:11,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 06:01:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:01:11,190 INFO L87 Difference]: Start difference. First operand 418 states and 577 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 06:01:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:11,243 INFO L93 Difference]: Finished difference Result 817 states and 1141 transitions. [2021-11-17 06:01:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 06:01:11,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 216 [2021-11-17 06:01:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:11,251 INFO L225 Difference]: With dead ends: 817 [2021-11-17 06:01:11,251 INFO L226 Difference]: Without dead ends: 428 [2021-11-17 06:01:11,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:01:11,253 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 3 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:11,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1076 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 06:01:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-11-17 06:01:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2021-11-17 06:01:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 333 states have (on average 1.3603603603603605) internal successors, (453), 336 states have internal predecessors, (453), 67 states have call successors, (67), 26 states have call predecessors, (67), 25 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 06:01:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 586 transitions. [2021-11-17 06:01:11,268 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 586 transitions. Word has length 216 [2021-11-17 06:01:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:11,268 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 586 transitions. [2021-11-17 06:01:11,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 06:01:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 586 transitions. [2021-11-17 06:01:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-11-17 06:01:11,273 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:11,273 INFO L514 BasicCegarLoop]: trace histogram [29, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 06:01:11,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:11,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:11,487 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash -658558438, now seen corresponding path program 1 times [2021-11-17 06:01:11,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:11,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894440454] [2021-11-17 06:01:11,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:11,489 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:11,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:11,491 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:11,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-17 06:01:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:12,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-17 06:01:12,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 367 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-11-17 06:01:13,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 46 proven. 214 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2021-11-17 06:01:15,033 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:15,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894440454] [2021-11-17 06:01:15,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894440454] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:01:15,034 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:01:15,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-11-17 06:01:15,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049336536] [2021-11-17 06:01:15,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:01:15,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-17 06:01:15,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-17 06:01:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-11-17 06:01:15,035 INFO L87 Difference]: Start difference. First operand 426 states and 586 transitions. Second operand has 23 states, 21 states have (on average 6.619047619047619) internal successors, (139), 23 states have internal predecessors, (139), 4 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2021-11-17 06:01:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:16,090 INFO L93 Difference]: Finished difference Result 852 states and 1177 transitions. [2021-11-17 06:01:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-17 06:01:16,091 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.619047619047619) internal successors, (139), 23 states have internal predecessors, (139), 4 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 226 [2021-11-17 06:01:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:16,093 INFO L225 Difference]: With dead ends: 852 [2021-11-17 06:01:16,094 INFO L226 Difference]: Without dead ends: 427 [2021-11-17 06:01:16,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2021-11-17 06:01:16,097 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 33 mSDsluCounter, 6358 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 6891 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:16,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 6891 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-17 06:01:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-11-17 06:01:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-11-17 06:01:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 334 states have (on average 1.3592814371257484) internal successors, (454), 337 states have internal predecessors, (454), 67 states have call successors, (67), 26 states have call predecessors, (67), 25 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2021-11-17 06:01:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 587 transitions. [2021-11-17 06:01:16,110 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 587 transitions. Word has length 226 [2021-11-17 06:01:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:16,110 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 587 transitions. [2021-11-17 06:01:16,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.619047619047619) internal successors, (139), 23 states have internal predecessors, (139), 4 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2021-11-17 06:01:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 587 transitions. [2021-11-17 06:01:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-11-17 06:01:16,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:16,113 INFO L514 BasicCegarLoop]: trace histogram [32, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 06:01:16,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:16,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:16,327 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:16,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash -838387952, now seen corresponding path program 1 times [2021-11-17 06:01:16,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:16,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861282374] [2021-11-17 06:01:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:16,329 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:16,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:16,331 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:16,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-17 06:01:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:17,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 1246 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 06:01:17,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2021-11-17 06:01:18,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2021-11-17 06:01:18,613 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:18,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861282374] [2021-11-17 06:01:18,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861282374] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:01:18,613 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:01:18,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 06:01:18,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461905456] [2021-11-17 06:01:18,613 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:01:18,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 06:01:18,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:18,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 06:01:18,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:01:18,616 INFO L87 Difference]: Start difference. First operand 427 states and 587 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 06:01:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:18,734 INFO L93 Difference]: Finished difference Result 865 states and 1191 transitions. [2021-11-17 06:01:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 06:01:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 232 [2021-11-17 06:01:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:18,737 INFO L225 Difference]: With dead ends: 865 [2021-11-17 06:01:18,737 INFO L226 Difference]: Without dead ends: 465 [2021-11-17 06:01:18,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:01:18,740 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 56 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:18,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 1041 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 06:01:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-11-17 06:01:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 462. [2021-11-17 06:01:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 366 states have (on average 1.355191256830601) internal successors, (496), 369 states have internal predecessors, (496), 68 states have call successors, (68), 28 states have call predecessors, (68), 27 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-17 06:01:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 631 transitions. [2021-11-17 06:01:18,759 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 631 transitions. Word has length 232 [2021-11-17 06:01:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:18,759 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 631 transitions. [2021-11-17 06:01:18,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 06:01:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 631 transitions. [2021-11-17 06:01:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-11-17 06:01:18,762 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:18,766 INFO L514 BasicCegarLoop]: trace histogram [32, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 06:01:18,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:18,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:18,988 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:18,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1628498556, now seen corresponding path program 1 times [2021-11-17 06:01:18,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:18,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852245844] [2021-11-17 06:01:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:18,989 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:18,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:18,990 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:18,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-17 06:01:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:20,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 06:01:20,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2021-11-17 06:01:21,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2021-11-17 06:01:21,677 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:21,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852245844] [2021-11-17 06:01:21,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852245844] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:01:21,678 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:01:21,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-17 06:01:21,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381338311] [2021-11-17 06:01:21,678 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:01:21,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 06:01:21,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:21,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 06:01:21,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 06:01:21,680 INFO L87 Difference]: Start difference. First operand 462 states and 631 transitions. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 06:01:23,737 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 06:01:25,743 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 06:01:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:25,844 INFO L93 Difference]: Finished difference Result 885 states and 1219 transitions. [2021-11-17 06:01:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 06:01:25,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 282 [2021-11-17 06:01:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:25,847 INFO L225 Difference]: With dead ends: 885 [2021-11-17 06:01:25,847 INFO L226 Difference]: Without dead ends: 460 [2021-11-17 06:01:25,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-17 06:01:25,849 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 11 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3216 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:25,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 3216 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2021-11-17 06:01:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-11-17 06:01:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2021-11-17 06:01:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 364 states have (on average 1.348901098901099) internal successors, (491), 367 states have internal predecessors, (491), 68 states have call successors, (68), 28 states have call predecessors, (68), 27 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2021-11-17 06:01:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 626 transitions. [2021-11-17 06:01:25,862 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 626 transitions. Word has length 282 [2021-11-17 06:01:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:25,862 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 626 transitions. [2021-11-17 06:01:25,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 06:01:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 626 transitions. [2021-11-17 06:01:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2021-11-17 06:01:25,865 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:25,865 INFO L514 BasicCegarLoop]: trace histogram [32, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 06:01:25,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:26,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:26,092 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:26,092 INFO L85 PathProgramCache]: Analyzing trace with hash -998274672, now seen corresponding path program 1 times [2021-11-17 06:01:26,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:26,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540797824] [2021-11-17 06:01:26,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:26,094 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:26,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:26,095 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:26,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-17 06:01:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:27,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 06:01:27,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2021-11-17 06:01:28,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2021-11-17 06:01:28,943 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:28,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540797824] [2021-11-17 06:01:28,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540797824] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:01:28,943 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:01:28,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 06:01:28,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453213570] [2021-11-17 06:01:28,943 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:01:28,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 06:01:28,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:28,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 06:01:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 06:01:28,945 INFO L87 Difference]: Start difference. First operand 460 states and 626 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 4 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2021-11-17 06:01:30,984 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 06:01:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:31,203 INFO L93 Difference]: Finished difference Result 960 states and 1327 transitions. [2021-11-17 06:01:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 06:01:31,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 4 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 290 [2021-11-17 06:01:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:31,207 INFO L225 Difference]: With dead ends: 960 [2021-11-17 06:01:31,207 INFO L226 Difference]: Without dead ends: 543 [2021-11-17 06:01:31,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 06:01:31,211 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 126 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:31,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 1509 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-11-17 06:01:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-11-17 06:01:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 537. [2021-11-17 06:01:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 435 states have (on average 1.360919540229885) internal successors, (592), 438 states have internal predecessors, (592), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:01:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 731 transitions. [2021-11-17 06:01:31,230 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 731 transitions. Word has length 290 [2021-11-17 06:01:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:31,232 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 731 transitions. [2021-11-17 06:01:31,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 4 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2021-11-17 06:01:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 731 transitions. [2021-11-17 06:01:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2021-11-17 06:01:31,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:31,236 INFO L514 BasicCegarLoop]: trace histogram [32, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 06:01:31,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-17 06:01:31,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:31,456 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:31,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 643253764, now seen corresponding path program 1 times [2021-11-17 06:01:31,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:31,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371364648] [2021-11-17 06:01:31,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:31,457 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:31,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:31,458 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:31,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-17 06:01:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:33,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 06:01:33,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2021-11-17 06:01:33,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2021-11-17 06:01:34,114 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:34,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371364648] [2021-11-17 06:01:34,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371364648] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:01:34,114 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:01:34,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 06:01:34,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882768873] [2021-11-17 06:01:34,114 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:01:34,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 06:01:34,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 06:01:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:01:34,116 INFO L87 Difference]: Start difference. First operand 537 states and 731 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:34,158 INFO L93 Difference]: Finished difference Result 1176 states and 1630 transitions. [2021-11-17 06:01:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 06:01:34,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 301 [2021-11-17 06:01:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:34,163 INFO L225 Difference]: With dead ends: 1176 [2021-11-17 06:01:34,163 INFO L226 Difference]: Without dead ends: 682 [2021-11-17 06:01:34,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:01:34,165 INFO L933 BasicCegarLoop]: 610 mSDtfsCounter, 76 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:34,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 1145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 06:01:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-11-17 06:01:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 538. [2021-11-17 06:01:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 436 states have (on average 1.360091743119266) internal successors, (593), 439 states have internal predecessors, (593), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:01:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 732 transitions. [2021-11-17 06:01:34,183 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 732 transitions. Word has length 301 [2021-11-17 06:01:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:34,183 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 732 transitions. [2021-11-17 06:01:34,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 732 transitions. [2021-11-17 06:01:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-11-17 06:01:34,186 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:34,187 INFO L514 BasicCegarLoop]: trace histogram [32, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 06:01:34,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:34,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:34,403 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1512261451, now seen corresponding path program 1 times [2021-11-17 06:01:34,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:34,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374450161] [2021-11-17 06:01:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:34,405 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:34,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:34,406 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:34,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-17 06:01:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:36,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 1426 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 06:01:36,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2021-11-17 06:01:36,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2021-11-17 06:01:37,023 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:37,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374450161] [2021-11-17 06:01:37,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374450161] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:01:37,023 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:01:37,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 06:01:37,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127463774] [2021-11-17 06:01:37,024 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:01:37,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 06:01:37,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:37,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 06:01:37,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 06:01:37,025 INFO L87 Difference]: Start difference. First operand 538 states and 732 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:37,066 INFO L93 Difference]: Finished difference Result 1037 states and 1424 transitions. [2021-11-17 06:01:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 06:01:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 297 [2021-11-17 06:01:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:37,070 INFO L225 Difference]: With dead ends: 1037 [2021-11-17 06:01:37,070 INFO L226 Difference]: Without dead ends: 542 [2021-11-17 06:01:37,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 06:01:37,073 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:37,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1069 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 06:01:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-11-17 06:01:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2021-11-17 06:01:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 440 states have (on average 1.356818181818182) internal successors, (597), 443 states have internal predecessors, (597), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:01:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 736 transitions. [2021-11-17 06:01:37,089 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 736 transitions. Word has length 297 [2021-11-17 06:01:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:37,090 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 736 transitions. [2021-11-17 06:01:37,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 736 transitions. [2021-11-17 06:01:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-11-17 06:01:37,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:37,101 INFO L514 BasicCegarLoop]: trace histogram [32, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 06:01:37,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-11-17 06:01:37,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:37,328 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash 581050700, now seen corresponding path program 1 times [2021-11-17 06:01:37,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:37,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459227049] [2021-11-17 06:01:37,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:37,329 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:37,330 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:37,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-17 06:01:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:38,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 06:01:38,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2021-11-17 06:01:39,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2021-11-17 06:01:39,991 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:39,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459227049] [2021-11-17 06:01:39,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459227049] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:01:39,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:01:39,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-17 06:01:39,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236945199] [2021-11-17 06:01:39,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:01:39,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 06:01:39,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:39,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 06:01:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 06:01:39,994 INFO L87 Difference]: Start difference. First operand 542 states and 736 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:40,113 INFO L93 Difference]: Finished difference Result 1049 states and 1438 transitions. [2021-11-17 06:01:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 06:01:40,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 305 [2021-11-17 06:01:40,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:40,116 INFO L225 Difference]: With dead ends: 1049 [2021-11-17 06:01:40,117 INFO L226 Difference]: Without dead ends: 550 [2021-11-17 06:01:40,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-17 06:01:40,119 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 0 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:40,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2674 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 06:01:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-11-17 06:01:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2021-11-17 06:01:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 448 states have (on average 1.3504464285714286) internal successors, (605), 451 states have internal predecessors, (605), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:01:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 744 transitions. [2021-11-17 06:01:40,133 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 744 transitions. Word has length 305 [2021-11-17 06:01:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:40,134 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 744 transitions. [2021-11-17 06:01:40,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 744 transitions. [2021-11-17 06:01:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2021-11-17 06:01:40,137 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:40,137 INFO L514 BasicCegarLoop]: trace histogram [32, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 06:01:40,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:40,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:40,356 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash -412397812, now seen corresponding path program 1 times [2021-11-17 06:01:40,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:40,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075225135] [2021-11-17 06:01:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:40,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:40,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:40,358 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:40,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-17 06:01:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:41,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-17 06:01:41,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2021-11-17 06:01:42,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2021-11-17 06:01:43,167 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:43,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075225135] [2021-11-17 06:01:43,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075225135] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:01:43,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:01:43,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-17 06:01:43,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658627565] [2021-11-17 06:01:43,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:01:43,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-17 06:01:43,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:43,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-17 06:01:43,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-17 06:01:43,169 INFO L87 Difference]: Start difference. First operand 550 states and 744 transitions. Second operand has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:43,791 INFO L93 Difference]: Finished difference Result 1073 states and 1466 transitions. [2021-11-17 06:01:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 06:01:43,791 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 316 [2021-11-17 06:01:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:43,795 INFO L225 Difference]: With dead ends: 1073 [2021-11-17 06:01:43,795 INFO L226 Difference]: Without dead ends: 566 [2021-11-17 06:01:43,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-17 06:01:43,798 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 0 mSDsluCounter, 3773 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4314 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:43,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4314 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-17 06:01:43,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-11-17 06:01:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2021-11-17 06:01:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 464 states have (on average 1.3383620689655173) internal successors, (621), 467 states have internal predecessors, (621), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:01:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 760 transitions. [2021-11-17 06:01:43,815 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 760 transitions. Word has length 316 [2021-11-17 06:01:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:43,815 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 760 transitions. [2021-11-17 06:01:43,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 760 transitions. [2021-11-17 06:01:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2021-11-17 06:01:43,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:43,821 INFO L514 BasicCegarLoop]: trace histogram [32, 15, 14, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 06:01:43,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:44,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:44,044 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash 216521700, now seen corresponding path program 2 times [2021-11-17 06:01:44,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:44,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509849784] [2021-11-17 06:01:44,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 06:01:44,046 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:44,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:44,047 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:44,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-17 06:01:54,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-17 06:01:54,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 06:01:54,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-17 06:01:54,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2021-11-17 06:01:55,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:01:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2021-11-17 06:01:56,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:01:56,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509849784] [2021-11-17 06:01:56,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509849784] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:01:56,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:01:56,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-17 06:01:56,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974801128] [2021-11-17 06:01:56,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:01:56,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-17 06:01:56,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:01:56,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-17 06:01:56,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2021-11-17 06:01:56,436 INFO L87 Difference]: Start difference. First operand 566 states and 760 transitions. Second operand has 32 states, 32 states have (on average 6.53125) internal successors, (209), 32 states have internal predecessors, (209), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:01:57,390 INFO L93 Difference]: Finished difference Result 1091 states and 1477 transitions. [2021-11-17 06:01:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-17 06:01:57,391 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.53125) internal successors, (209), 32 states have internal predecessors, (209), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 332 [2021-11-17 06:01:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:01:57,394 INFO L225 Difference]: With dead ends: 1091 [2021-11-17 06:01:57,394 INFO L226 Difference]: Without dead ends: 568 [2021-11-17 06:01:57,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2021-11-17 06:01:57,396 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 0 mSDsluCounter, 8199 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8748 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-17 06:01:57,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8748 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-17 06:01:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-11-17 06:01:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2021-11-17 06:01:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 466 states have (on average 1.3369098712446352) internal successors, (623), 469 states have internal predecessors, (623), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:01:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 762 transitions. [2021-11-17 06:01:57,411 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 762 transitions. Word has length 332 [2021-11-17 06:01:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:01:57,412 INFO L470 AbstractCegarLoop]: Abstraction has 568 states and 762 transitions. [2021-11-17 06:01:57,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.53125) internal successors, (209), 32 states have internal predecessors, (209), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:01:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 762 transitions. [2021-11-17 06:01:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2021-11-17 06:01:57,415 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:01:57,415 INFO L514 BasicCegarLoop]: trace histogram [32, 16, 15, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 06:01:57,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-17 06:01:57,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:01:57,636 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:01:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:01:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1179141598, now seen corresponding path program 1 times [2021-11-17 06:01:57,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:01:57,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129470044] [2021-11-17 06:01:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:01:57,637 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:01:57,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:01:57,638 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:01:57,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-17 06:01:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:01:59,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 06:01:59,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:01:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2021-11-17 06:01:59,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:02:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2021-11-17 06:02:00,221 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:02:00,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129470044] [2021-11-17 06:02:00,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129470044] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:02:00,221 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:02:00,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 06:02:00,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085064101] [2021-11-17 06:02:00,221 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:02:00,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 06:02:00,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:02:00,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 06:02:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:02:00,222 INFO L87 Difference]: Start difference. First operand 568 states and 762 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 06:02:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:02:00,248 INFO L93 Difference]: Finished difference Result 1096 states and 1483 transitions. [2021-11-17 06:02:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 06:02:00,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 327 [2021-11-17 06:02:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:02:00,255 INFO L225 Difference]: With dead ends: 1096 [2021-11-17 06:02:00,255 INFO L226 Difference]: Without dead ends: 571 [2021-11-17 06:02:00,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 650 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 06:02:00,257 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 2 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 06:02:00,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1071 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 06:02:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-11-17 06:02:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2021-11-17 06:02:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 467 states have (on average 1.3361884368308352) internal successors, (624), 470 states have internal predecessors, (624), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:02:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 763 transitions. [2021-11-17 06:02:00,272 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 763 transitions. Word has length 327 [2021-11-17 06:02:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:02:00,273 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 763 transitions. [2021-11-17 06:02:00,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 06:02:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 763 transitions. [2021-11-17 06:02:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2021-11-17 06:02:00,276 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:02:00,277 INFO L514 BasicCegarLoop]: trace histogram [32, 16, 15, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-11-17 06:02:00,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-17 06:02:00,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:02:00,496 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:02:00,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:02:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash -606738034, now seen corresponding path program 1 times [2021-11-17 06:02:00,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:02:00,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678262381] [2021-11-17 06:02:00,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:02:00,497 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:02:00,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:02:00,498 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:02:00,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-17 06:02:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:02:02,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 1527 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 06:02:02,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:02:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2021-11-17 06:02:02,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:02:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2021-11-17 06:02:03,043 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:02:03,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678262381] [2021-11-17 06:02:03,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678262381] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:02:03,044 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:02:03,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-17 06:02:03,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014365792] [2021-11-17 06:02:03,044 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:02:03,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 06:02:03,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:02:03,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 06:02:03,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 06:02:03,045 INFO L87 Difference]: Start difference. First operand 569 states and 763 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 06:02:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:02:03,165 INFO L93 Difference]: Finished difference Result 1097 states and 1483 transitions. [2021-11-17 06:02:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 06:02:03,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 330 [2021-11-17 06:02:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:02:03,170 INFO L225 Difference]: With dead ends: 1097 [2021-11-17 06:02:03,170 INFO L226 Difference]: Without dead ends: 571 [2021-11-17 06:02:03,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 06:02:03,172 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 403 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 06:02:03,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 1760 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 06:02:03,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-11-17 06:02:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2021-11-17 06:02:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 467 states have (on average 1.3319057815845825) internal successors, (622), 470 states have internal predecessors, (622), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:02:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 761 transitions. [2021-11-17 06:02:03,188 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 761 transitions. Word has length 330 [2021-11-17 06:02:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:02:03,189 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 761 transitions. [2021-11-17 06:02:03,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 06:02:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 761 transitions. [2021-11-17 06:02:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-11-17 06:02:03,192 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:02:03,193 INFO L514 BasicCegarLoop]: trace histogram [32, 16, 15, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 06:02:03,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-11-17 06:02:03,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:02:03,412 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:02:03,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:02:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash -269382671, now seen corresponding path program 1 times [2021-11-17 06:02:03,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:02:03,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667918981] [2021-11-17 06:02:03,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:02:03,414 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:02:03,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:02:03,415 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:02:03,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-17 06:02:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:02:05,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 06:02:05,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:02:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [2021-11-17 06:02:05,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:02:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2021-11-17 06:02:06,156 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:02:06,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667918981] [2021-11-17 06:02:06,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667918981] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:02:06,159 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:02:06,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-17 06:02:06,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124989687] [2021-11-17 06:02:06,160 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:02:06,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 06:02:06,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:02:06,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 06:02:06,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 06:02:06,161 INFO L87 Difference]: Start difference. First operand 569 states and 761 transitions. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:02:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:02:06,232 INFO L93 Difference]: Finished difference Result 1099 states and 1482 transitions. [2021-11-17 06:02:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 06:02:06,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 350 [2021-11-17 06:02:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:02:06,236 INFO L225 Difference]: With dead ends: 1099 [2021-11-17 06:02:06,236 INFO L226 Difference]: Without dead ends: 573 [2021-11-17 06:02:06,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 06:02:06,238 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 2 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 06:02:06,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2660 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 06:02:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-11-17 06:02:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 571. [2021-11-17 06:02:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 469 states have (on average 1.3304904051172708) internal successors, (624), 472 states have internal predecessors, (624), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:02:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 763 transitions. [2021-11-17 06:02:06,264 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 763 transitions. Word has length 350 [2021-11-17 06:02:06,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:02:06,265 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 763 transitions. [2021-11-17 06:02:06,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-17 06:02:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 763 transitions. [2021-11-17 06:02:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2021-11-17 06:02:06,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:02:06,268 INFO L514 BasicCegarLoop]: trace histogram [32, 16, 15, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 06:02:06,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-17 06:02:06,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:02:06,486 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:02:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:02:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1390444470, now seen corresponding path program 1 times [2021-11-17 06:02:06,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:02:06,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649289267] [2021-11-17 06:02:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:02:06,488 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:02:06,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:02:06,489 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:02:06,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-17 06:02:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:02:08,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-17 06:02:08,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:02:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2021-11-17 06:02:08,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:02:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1123 trivial. 0 not checked. [2021-11-17 06:02:09,412 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:02:09,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649289267] [2021-11-17 06:02:09,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649289267] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 06:02:09,412 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 06:02:09,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-17 06:02:09,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987262990] [2021-11-17 06:02:09,412 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 06:02:09,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 06:02:09,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:02:09,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 06:02:09,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 06:02:09,414 INFO L87 Difference]: Start difference. First operand 571 states and 763 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 06:02:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:02:09,533 INFO L93 Difference]: Finished difference Result 1105 states and 1489 transitions. [2021-11-17 06:02:09,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 06:02:09,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 347 [2021-11-17 06:02:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:02:09,545 INFO L225 Difference]: With dead ends: 1105 [2021-11-17 06:02:09,545 INFO L226 Difference]: Without dead ends: 577 [2021-11-17 06:02:09,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 06:02:09,548 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 11 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 06:02:09,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 1599 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 06:02:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-11-17 06:02:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 573. [2021-11-17 06:02:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 471 states have (on average 1.3290870488322717) internal successors, (626), 474 states have internal predecessors, (626), 70 states have call successors, (70), 32 states have call predecessors, (70), 31 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2021-11-17 06:02:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 765 transitions. [2021-11-17 06:02:09,567 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 765 transitions. Word has length 347 [2021-11-17 06:02:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:02:09,567 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 765 transitions. [2021-11-17 06:02:09,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-17 06:02:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 765 transitions. [2021-11-17 06:02:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2021-11-17 06:02:09,589 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:02:09,589 INFO L514 BasicCegarLoop]: trace histogram [32, 16, 15, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 06:02:09,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-11-17 06:02:09,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:02:09,812 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:02:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:02:09,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1722630038, now seen corresponding path program 1 times [2021-11-17 06:02:09,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:02:09,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601053247] [2021-11-17 06:02:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:02:09,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:02:09,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:02:09,814 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:02:09,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-11-17 06:02:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:02:11,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 06:02:11,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:02:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2021-11-17 06:02:12,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 06:02:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2021-11-17 06:02:12,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 06:02:12,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601053247] [2021-11-17 06:02:12,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601053247] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 06:02:12,936 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 06:02:12,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-17 06:02:12,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213013306] [2021-11-17 06:02:12,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 06:02:12,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 06:02:12,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 06:02:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 06:02:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 06:02:12,938 INFO L87 Difference]: Start difference. First operand 573 states and 765 transitions. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 4 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-17 06:02:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 06:02:15,776 INFO L93 Difference]: Finished difference Result 1163 states and 1585 transitions. [2021-11-17 06:02:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 06:02:15,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 4 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 357 [2021-11-17 06:02:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 06:02:15,779 INFO L225 Difference]: With dead ends: 1163 [2021-11-17 06:02:15,779 INFO L226 Difference]: Without dead ends: 633 [2021-11-17 06:02:15,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-11-17 06:02:15,781 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 84 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-17 06:02:15,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 2226 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-17 06:02:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-11-17 06:02:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 615. [2021-11-17 06:02:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 507 states have (on average 1.3293885601577908) internal successors, (674), 513 states have internal predecessors, (674), 76 states have call successors, (76), 32 states have call predecessors, (76), 31 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2021-11-17 06:02:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 825 transitions. [2021-11-17 06:02:15,808 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 825 transitions. Word has length 357 [2021-11-17 06:02:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 06:02:15,809 INFO L470 AbstractCegarLoop]: Abstraction has 615 states and 825 transitions. [2021-11-17 06:02:15,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 4 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-17 06:02:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 825 transitions. [2021-11-17 06:02:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-11-17 06:02:15,813 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 06:02:15,813 INFO L514 BasicCegarLoop]: trace histogram [32, 16, 15, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 06:02:15,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-11-17 06:02:16,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 06:02:16,032 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 06:02:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 06:02:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1584072819, now seen corresponding path program 1 times [2021-11-17 06:02:16,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 06:02:16,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137948701] [2021-11-17 06:02:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 06:02:16,033 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 06:02:16,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 06:02:16,034 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 06:02:16,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-11-17 06:02:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 06:02:24,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 1614 conjuncts, 135 conjunts are in the unsatisfiable core [2021-11-17 06:02:25,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 06:02:25,920 INFO L354 Elim1Store]: treesize reduction 936, result has 7.1 percent of original size [2021-11-17 06:02:25,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 11 case distinctions, treesize of input 143 treesize of output 182 [2021-11-17 06:02:26,011 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-17 06:02:26,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 165 [2021-11-17 06:02:26,038 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-17 06:02:26,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 151 [2021-11-17 06:02:29,135 INFO L354 Elim1Store]: treesize reduction 568, result has 22.1 percent of original size [2021-11-17 06:02:29,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 207 treesize of output 339 [2021-11-17 06:02:30,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-17 06:02:30,718 INFO L354 Elim1Store]: treesize reduction 34, result has 22.7 percent of original size [2021-11-17 06:02:30,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-11-17 06:02:30,970 INFO L354 Elim1Store]: treesize reduction 60, result has 22.1 percent of original size [2021-11-17 06:02:30,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2021-11-17 06:02:31,372 INFO L354 Elim1Store]: treesize reduction 110, result has 19.1 percent of original size [2021-11-17 06:02:31,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 52 [2021-11-17 06:02:33,445 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-17 06:02:33,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 20 [2021-11-17 06:02:36,337 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2053| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2053|) ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:02:38,374 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2054| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2053| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2053|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2054|) .cse0))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:02:40,410 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2055| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2054| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2053| (_ BitVec 64))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2053|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2054|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2055|) .cse0))))) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:02:42,471 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2056| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2055| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2054| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2053| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2053|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2054|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2055|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2056|) .cse0))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:02:44,528 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2056| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2055| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2057| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2054| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2053| (_ BitVec 64))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2053|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2054|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2055|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2056|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2057|) .cse0))))) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:02:46,638 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2056| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2055| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2058| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2057| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2054| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2053| (_ BitVec 64))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2053|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2054|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2055|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2056|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2057|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2058|) .cse0))))) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:02:48,768 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2059| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2056| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2055| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2058| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2057| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2054| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2053| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2053|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2054|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2055|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2056|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2057|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2058|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2059|) .cse0))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:02:50,943 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2059| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2056| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2055| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2058| (_ BitVec 64)) (|#Ultimate.C_memset_#ptr.offset| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2057| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2054| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2053| (_ BitVec 64)) (|#Ultimate.C_memset_#value| (_ BitVec 32)) (|v_#Ultimate.C_memset_#t~loopctr404_2060| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |#Ultimate.C_memset_#value|)))) (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2053|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2054|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2055|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2056|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2057|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2058|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2059|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2060|) .cse0))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:02:53,322 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2059| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2056| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2055| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2058| (_ BitVec 64)) (|#Ultimate.C_memset_#ptr.offset| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2057| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2054| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2053| (_ BitVec 64)) (|#Ultimate.C_memset_#value| (_ BitVec 32)) (|v_#Ultimate.C_memset_#t~loopctr404_2060| (_ BitVec 64))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_ldv_memset_#in~s.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |#Ultimate.C_memset_#value|)))) (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_ldv_memset_#in~s.base|) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2053|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2054|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2055|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2056|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2057|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2058|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2059|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2060|) .cse0))))) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:02:53,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:02:53,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:02:53,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:02:53,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:02:53,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:02:53,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:04:48,784 WARN L227 SmtUtils]: Spent 1.92m on a formula simplification. DAG size of input: 288 DAG size of output: 65 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-17 06:04:48,785 INFO L354 Elim1Store]: treesize reduction 3395, result has 3.5 percent of original size [2021-11-17 06:04:48,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 115 treesize of output 163 [2021-11-17 06:04:54,858 INFO L354 Elim1Store]: treesize reduction 400, result has 0.2 percent of original size [2021-11-17 06:04:54,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 53 [2021-11-17 06:04:57,474 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2061| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2061|) ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:04:59,518 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2062| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2061| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2061|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2062|) .cse0))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:05:01,565 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2063| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2062| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2061| (_ BitVec 64))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2061|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2062|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2063|) .cse0))))) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:05:03,620 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2063| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2062| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2064| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2061| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2061|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2062|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2063|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2064|) .cse0))) |c_#memory_int|))) is different from true [2021-11-17 06:05:05,679 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2063| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2062| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2065| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2064| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2061| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2061|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2062|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2063|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2064|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2065|) .cse0))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:05:07,744 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2066| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2063| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2062| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2065| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2064| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2061| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2061|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2062|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2063|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2064|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2065|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2066|) .cse0))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:05:09,879 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2067| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2066| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2063| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2062| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2065| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2064| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2061| (_ BitVec 64))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |c_#Ultimate.C_memset_#value|)))) (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2061|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2062|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2063|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2064|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2065|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2066|) .cse0) (bvadd |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2067|) .cse0))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:05:12,057 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2067| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2066| (_ BitVec 64)) (|#Ultimate.C_memset_#ptr.offset| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2068| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2063| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2062| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2065| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2064| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2061| (_ BitVec 64)) (|#Ultimate.C_memset_#value| (_ BitVec 32))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |#Ultimate.C_memset_#value|)))) (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2061|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2062|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2063|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2064|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2065|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2066|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2067|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2068|) .cse0))) |c_#memory_int|)) (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|)))) is different from true [2021-11-17 06:05:14,516 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2| |c_~#adapters_list_g~0.base|)) (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg1~0#1.base_BEFORE_CALL_2|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr404_2067| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2066| (_ BitVec 64)) (|#Ultimate.C_memset_#ptr.offset| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2068| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2063| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2062| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2065| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2064| (_ BitVec 64)) (|v_#Ultimate.C_memset_#t~loopctr404_2061| (_ BitVec 64)) (|#Ultimate.C_memset_#value| (_ BitVec 32))) (= (store |c_old(#memory_int)| |c_ldv_memset_#in~s.base| (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) |#Ultimate.C_memset_#value|)))) (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_ldv_memset_#in~s.base|) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2061|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2062|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2063|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2064|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2065|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2066|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2067|) .cse0) (bvadd |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr404_2068|) .cse0))) |c_#memory_int|))) is different from true [2021-11-17 06:05:14,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:05:14,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:05:14,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:05:14,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:05:14,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:05:14,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:08:57,698 WARN L227 SmtUtils]: Spent 3.71m on a formula simplification. DAG size of input: 610 DAG size of output: 89 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-17 06:08:57,699 INFO L354 Elim1Store]: treesize reduction 6774, result has 2.4 percent of original size [2021-11-17 06:08:57,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 46 case distinctions, treesize of input 182 treesize of output 241 [2021-11-17 06:09:19,344 INFO L354 Elim1Store]: treesize reduction 1604, result has 0.1 percent of original size [2021-11-17 06:09:19,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 188 treesize of output 100 [2021-11-17 06:09:29,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:09:29,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:09:29,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:09:29,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:09:29,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:09:29,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:09:29,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-17 06:09:29,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-17 06:09:29,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-17 06:09:29,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-17 06:10:59,489 WARN L227 SmtUtils]: Spent 1.51m on a formula simplification. DAG size of input: 984 DAG size of output: 301 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-17 06:10:59,491 INFO L354 Elim1Store]: treesize reduction 6690, result has 13.2 percent of original size [2021-11-17 06:10:59,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 30 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 130 case distinctions, treesize of input 231 treesize of output 1179 Killed by 15