./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.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 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 00:25:27,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 00:25:27,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 00:25:27,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 00:25:27,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 00:25:27,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 00:25:27,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 00:25:27,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 00:25:27,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 00:25:27,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 00:25:27,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 00:25:27,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 00:25:27,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 00:25:27,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 00:25:27,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 00:25:27,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 00:25:27,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 00:25:27,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 00:25:27,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 00:25:27,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 00:25:27,256 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 00:25:27,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 00:25:27,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 00:25:27,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 00:25:27,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 00:25:27,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 00:25:27,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 00:25:27,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 00:25:27,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 00:25:27,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 00:25:27,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 00:25:27,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 00:25:27,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 00:25:27,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 00:25:27,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 00:25:27,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 00:25:27,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 00:25:27,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 00:25:27,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 00:25:27,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 00:25:27,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 00:25:27,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 00:25:27,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 00:25:27,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 00:25:27,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 00:25:27,307 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 00:25:27,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 00:25:27,308 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 00:25:27,308 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 00:25:27,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 00:25:27,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 00:25:27,309 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 00:25:27,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 00:25:27,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 00:25:27,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 00:25:27,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 00:25:27,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 00:25:27,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 00:25:27,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 00:25:27,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 00:25:27,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 00:25:27,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 00:25:27,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 00:25:27,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 00:25:27,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:25:27,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 00:25:27,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 00:25:27,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 00:25:27,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 00:25:27,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 00:25:27,313 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 00:25:27,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 00:25:27,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 00:25:27,314 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 -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2022-07-23 00:25:27,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 00:25:27,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 00:25:27,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 00:25:27,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 00:25:27,617 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 00:25:27,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-23 00:25:27,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c032728a9/9703dac4261d4fe4a41049bf98d94cec/FLAG1edc1da17 [2022-07-23 00:25:28,328 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 00:25:28,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-23 00:25:28,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c032728a9/9703dac4261d4fe4a41049bf98d94cec/FLAG1edc1da17 [2022-07-23 00:25:28,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c032728a9/9703dac4261d4fe4a41049bf98d94cec [2022-07-23 00:25:28,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 00:25:28,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 00:25:28,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 00:25:28,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 00:25:28,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 00:25:28,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:25:28" (1/1) ... [2022-07-23 00:25:28,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1628df1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:28, skipping insertion in model container [2022-07-23 00:25:28,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:25:28" (1/1) ... [2022-07-23 00:25:28,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 00:25:28,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 00:25:29,474 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-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-07-23 00:25:29,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:25:29,544 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 00:25:29,718 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-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-07-23 00:25:29,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:25:29,768 INFO L208 MainTranslator]: Completed translation [2022-07-23 00:25:29,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29 WrapperNode [2022-07-23 00:25:29,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 00:25:29,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 00:25:29,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 00:25:29,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 00:25:29,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,888 INFO L137 Inliner]: procedures = 107, calls = 312, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 771 [2022-07-23 00:25:29,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 00:25:29,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 00:25:29,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 00:25:29,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 00:25:29,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 00:25:29,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 00:25:29,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 00:25:29,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 00:25:29,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (1/1) ... [2022-07-23 00:25:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:25:30,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:30,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 00:25:30,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 00:25:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 00:25:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 00:25:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 00:25:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 00:25:30,085 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 00:25:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 00:25:30,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 00:25:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 00:25:30,086 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 00:25:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-23 00:25:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-23 00:25:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 00:25:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-23 00:25:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-23 00:25:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 00:25:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 00:25:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-07-23 00:25:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-07-23 00:25:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-23 00:25:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-23 00:25:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 00:25:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 00:25:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 00:25:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 00:25:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 00:25:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 00:25:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 00:25:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-23 00:25:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-23 00:25:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-23 00:25:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-23 00:25:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-07-23 00:25:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-07-23 00:25:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 00:25:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 00:25:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 00:25:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-23 00:25:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-23 00:25:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-23 00:25:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-23 00:25:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 00:25:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 00:25:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 00:25:30,391 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 00:25:30,393 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 00:25:30,471 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 00:25:31,017 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 00:25:31,025 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 00:25:31,025 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 00:25:31,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:25:31 BoogieIcfgContainer [2022-07-23 00:25:31,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 00:25:31,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 00:25:31,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 00:25:31,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 00:25:31,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:25:28" (1/3) ... [2022-07-23 00:25:31,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274d7b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:25:31, skipping insertion in model container [2022-07-23 00:25:31,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:25:29" (2/3) ... [2022-07-23 00:25:31,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274d7b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:25:31, skipping insertion in model container [2022-07-23 00:25:31,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:25:31" (3/3) ... [2022-07-23 00:25:31,035 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-23 00:25:31,047 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 00:25:31,047 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-23 00:25:31,089 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 00:25:31,094 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@106c6081, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cfe3a1d [2022-07-23 00:25:31,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-23 00:25:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 187 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-07-23 00:25:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 00:25:31,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:31,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:31,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1083564762, now seen corresponding path program 1 times [2022-07-23 00:25:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:31,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041300942] [2022-07-23 00:25:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 00:25:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:31,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041300942] [2022-07-23 00:25:31,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041300942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:31,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:31,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:25:31,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154802756] [2022-07-23 00:25:31,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:31,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:25:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:31,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:25:31,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 00:25:31,556 INFO L87 Difference]: Start difference. First operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 187 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 00:25:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:31,935 INFO L93 Difference]: Finished difference Result 472 states and 644 transitions. [2022-07-23 00:25:31,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:25:31,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-23 00:25:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:31,956 INFO L225 Difference]: With dead ends: 472 [2022-07-23 00:25:31,956 INFO L226 Difference]: Without dead ends: 231 [2022-07-23 00:25:31,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 00:25:31,974 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 84 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:31,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 464 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:25:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-23 00:25:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-07-23 00:25:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 176 states have internal predecessors, (218), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-23 00:25:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 291 transitions. [2022-07-23 00:25:32,038 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 291 transitions. Word has length 32 [2022-07-23 00:25:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:32,039 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 291 transitions. [2022-07-23 00:25:32,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 00:25:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 291 transitions. [2022-07-23 00:25:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 00:25:32,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:32,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:32,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 00:25:32,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash -660862936, now seen corresponding path program 1 times [2022-07-23 00:25:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:32,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671807904] [2022-07-23 00:25:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 00:25:32,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:32,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671807904] [2022-07-23 00:25:32,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671807904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:32,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:32,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:32,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569510530] [2022-07-23 00:25:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:32,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:32,193 INFO L87 Difference]: Start difference. First operand 224 states and 291 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 00:25:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:32,763 INFO L93 Difference]: Finished difference Result 650 states and 851 transitions. [2022-07-23 00:25:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:25:32,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-23 00:25:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:32,767 INFO L225 Difference]: With dead ends: 650 [2022-07-23 00:25:32,767 INFO L226 Difference]: Without dead ends: 431 [2022-07-23 00:25:32,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:32,769 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 306 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:32,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 831 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 00:25:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-07-23 00:25:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 417. [2022-07-23 00:25:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 317 states have (on average 1.274447949526814) internal successors, (404), 325 states have internal predecessors, (404), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-23 00:25:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 541 transitions. [2022-07-23 00:25:32,825 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 541 transitions. Word has length 32 [2022-07-23 00:25:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:32,826 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 541 transitions. [2022-07-23 00:25:32,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-23 00:25:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 541 transitions. [2022-07-23 00:25:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 00:25:32,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:32,834 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:32,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 00:25:32,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash 748866141, now seen corresponding path program 1 times [2022-07-23 00:25:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:32,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798971596] [2022-07-23 00:25:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:32,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:33,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:33,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798971596] [2022-07-23 00:25:33,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798971596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:33,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:33,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:25:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113557340] [2022-07-23 00:25:33,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:33,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:25:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:33,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:25:33,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:33,015 INFO L87 Difference]: Start difference. First operand 417 states and 541 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-23 00:25:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:33,667 INFO L93 Difference]: Finished difference Result 990 states and 1323 transitions. [2022-07-23 00:25:33,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 00:25:33,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-23 00:25:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:33,672 INFO L225 Difference]: With dead ends: 990 [2022-07-23 00:25:33,672 INFO L226 Difference]: Without dead ends: 588 [2022-07-23 00:25:33,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:25:33,675 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 622 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:33,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1539 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 00:25:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-23 00:25:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 420. [2022-07-23 00:25:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 320 states have (on average 1.26875) internal successors, (406), 328 states have internal predecessors, (406), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-23 00:25:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 543 transitions. [2022-07-23 00:25:33,707 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 543 transitions. Word has length 55 [2022-07-23 00:25:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:33,710 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 543 transitions. [2022-07-23 00:25:33,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-23 00:25:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 543 transitions. [2022-07-23 00:25:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 00:25:33,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:33,714 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:33,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 00:25:33,714 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:33,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1486182813, now seen corresponding path program 1 times [2022-07-23 00:25:33,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:33,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301310304] [2022-07-23 00:25:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:33,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:33,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301310304] [2022-07-23 00:25:33,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301310304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:33,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:33,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085653155] [2022-07-23 00:25:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:33,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:33,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:33,904 INFO L87 Difference]: Start difference. First operand 420 states and 543 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:34,371 INFO L93 Difference]: Finished difference Result 1257 states and 1644 transitions. [2022-07-23 00:25:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:25:34,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2022-07-23 00:25:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:34,381 INFO L225 Difference]: With dead ends: 1257 [2022-07-23 00:25:34,381 INFO L226 Difference]: Without dead ends: 852 [2022-07-23 00:25:34,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:34,387 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 389 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:34,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 665 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 00:25:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-07-23 00:25:34,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 814. [2022-07-23 00:25:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 625 states have (on average 1.2656) internal successors, (791), 637 states have internal predecessors, (791), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-23 00:25:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1056 transitions. [2022-07-23 00:25:34,452 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1056 transitions. Word has length 55 [2022-07-23 00:25:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:34,453 INFO L495 AbstractCegarLoop]: Abstraction has 814 states and 1056 transitions. [2022-07-23 00:25:34,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1056 transitions. [2022-07-23 00:25:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 00:25:34,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:34,455 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:34,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 00:25:34,456 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1172967990, now seen corresponding path program 1 times [2022-07-23 00:25:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:34,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394071175] [2022-07-23 00:25:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:34,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394071175] [2022-07-23 00:25:34,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394071175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:34,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:34,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606094765] [2022-07-23 00:25:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:34,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:34,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:34,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:34,591 INFO L87 Difference]: Start difference. First operand 814 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:34,847 INFO L93 Difference]: Finished difference Result 844 states and 1101 transitions. [2022-07-23 00:25:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:25:34,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-07-23 00:25:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:34,852 INFO L225 Difference]: With dead ends: 844 [2022-07-23 00:25:34,852 INFO L226 Difference]: Without dead ends: 841 [2022-07-23 00:25:34,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:34,853 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 310 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:34,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 437 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:25:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-07-23 00:25:34,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 813. [2022-07-23 00:25:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 625 states have (on average 1.264) internal successors, (790), 636 states have internal predecessors, (790), 133 states have call successors, (133), 55 states have call predecessors, (133), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-23 00:25:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1054 transitions. [2022-07-23 00:25:34,892 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1054 transitions. Word has length 56 [2022-07-23 00:25:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:34,893 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1054 transitions. [2022-07-23 00:25:34,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1054 transitions. [2022-07-23 00:25:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 00:25:34,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:34,895 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:34,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 00:25:34,896 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2002259392, now seen corresponding path program 1 times [2022-07-23 00:25:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:34,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661033333] [2022-07-23 00:25:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:34,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:34,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:34,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661033333] [2022-07-23 00:25:34,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661033333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:34,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:34,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074942070] [2022-07-23 00:25:34,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:34,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:34,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:34,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:34,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:34,994 INFO L87 Difference]: Start difference. First operand 813 states and 1054 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:35,259 INFO L93 Difference]: Finished difference Result 843 states and 1099 transitions. [2022-07-23 00:25:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:25:35,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-23 00:25:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:35,264 INFO L225 Difference]: With dead ends: 843 [2022-07-23 00:25:35,264 INFO L226 Difference]: Without dead ends: 840 [2022-07-23 00:25:35,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:35,265 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 270 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:35,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 591 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:25:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-07-23 00:25:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 812. [2022-07-23 00:25:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 625 states have (on average 1.2624) internal successors, (789), 635 states have internal predecessors, (789), 132 states have call successors, (132), 55 states have call predecessors, (132), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-23 00:25:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1052 transitions. [2022-07-23 00:25:35,302 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1052 transitions. Word has length 57 [2022-07-23 00:25:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:35,302 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1052 transitions. [2022-07-23 00:25:35,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1052 transitions. [2022-07-23 00:25:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 00:25:35,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:35,304 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:35,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 00:25:35,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1940484211, now seen corresponding path program 1 times [2022-07-23 00:25:35,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:35,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547279165] [2022-07-23 00:25:35,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:35,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:35,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:35,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547279165] [2022-07-23 00:25:35,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547279165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:35,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:35,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:35,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35496138] [2022-07-23 00:25:35,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:35,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:35,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:35,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:35,411 INFO L87 Difference]: Start difference. First operand 812 states and 1052 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:35,637 INFO L93 Difference]: Finished difference Result 842 states and 1097 transitions. [2022-07-23 00:25:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:25:35,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-07-23 00:25:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:35,642 INFO L225 Difference]: With dead ends: 842 [2022-07-23 00:25:35,642 INFO L226 Difference]: Without dead ends: 839 [2022-07-23 00:25:35,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:35,643 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 304 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:35,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 431 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:25:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-23 00:25:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 811. [2022-07-23 00:25:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 625 states have (on average 1.2608) internal successors, (788), 634 states have internal predecessors, (788), 131 states have call successors, (131), 55 states have call predecessors, (131), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-23 00:25:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1050 transitions. [2022-07-23 00:25:35,681 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1050 transitions. Word has length 58 [2022-07-23 00:25:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:35,681 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1050 transitions. [2022-07-23 00:25:35,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1050 transitions. [2022-07-23 00:25:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 00:25:35,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:35,682 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 00:25:35,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 00:25:35,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:35,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash -25448733, now seen corresponding path program 1 times [2022-07-23 00:25:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:35,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226224868] [2022-07-23 00:25:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 00:25:35,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:35,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226224868] [2022-07-23 00:25:35,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226224868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:35,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:35,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:25:35,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830674669] [2022-07-23 00:25:35,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:35,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:25:35,772 INFO L87 Difference]: Start difference. First operand 811 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:36,021 INFO L93 Difference]: Finished difference Result 841 states and 1095 transitions. [2022-07-23 00:25:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:25:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2022-07-23 00:25:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:36,025 INFO L225 Difference]: With dead ends: 841 [2022-07-23 00:25:36,025 INFO L226 Difference]: Without dead ends: 829 [2022-07-23 00:25:36,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:36,026 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 301 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:36,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 430 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:25:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-07-23 00:25:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 801. [2022-07-23 00:25:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 616 states have (on average 1.2597402597402598) internal successors, (776), 624 states have internal predecessors, (776), 130 states have call successors, (130), 55 states have call predecessors, (130), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-23 00:25:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1037 transitions. [2022-07-23 00:25:36,065 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1037 transitions. Word has length 59 [2022-07-23 00:25:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:36,066 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1037 transitions. [2022-07-23 00:25:36,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 00:25:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1037 transitions. [2022-07-23 00:25:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-23 00:25:36,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:36,069 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-23 00:25:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 00:25:36,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:36,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1150661192, now seen corresponding path program 1 times [2022-07-23 00:25:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:36,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675837455] [2022-07-23 00:25:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-23 00:25:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 00:25:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 00:25:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 00:25:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 00:25:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 00:25:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 00:25:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 00:25:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 00:25:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 00:25:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-23 00:25:36,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:36,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675837455] [2022-07-23 00:25:36,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675837455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:36,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:36,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:25:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347277327] [2022-07-23 00:25:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:36,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:25:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:36,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:25:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:25:36,227 INFO L87 Difference]: Start difference. First operand 801 states and 1037 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:36,570 INFO L93 Difference]: Finished difference Result 1679 states and 2189 transitions. [2022-07-23 00:25:36,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:25:36,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2022-07-23 00:25:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:36,575 INFO L225 Difference]: With dead ends: 1679 [2022-07-23 00:25:36,575 INFO L226 Difference]: Without dead ends: 893 [2022-07-23 00:25:36,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 00:25:36,579 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 212 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:36,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 777 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 00:25:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-07-23 00:25:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 855. [2022-07-23 00:25:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 669 states have (on average 1.2705530642750373) internal successors, (850), 677 states have internal predecessors, (850), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-23 00:25:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1111 transitions. [2022-07-23 00:25:36,622 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1111 transitions. Word has length 160 [2022-07-23 00:25:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:36,622 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1111 transitions. [2022-07-23 00:25:36,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1111 transitions. [2022-07-23 00:25:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-23 00:25:36,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:36,626 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 00:25:36,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 00:25:36,626 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:36,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:36,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1334474301, now seen corresponding path program 1 times [2022-07-23 00:25:36,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:36,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186344160] [2022-07-23 00:25:36,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:36,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:25:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:25:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:25:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-23 00:25:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 00:25:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 00:25:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:25:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 00:25:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 00:25:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 00:25:36,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:36,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186344160] [2022-07-23 00:25:36,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186344160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:36,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:36,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 00:25:36,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752408444] [2022-07-23 00:25:36,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:36,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 00:25:36,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:36,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 00:25:36,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:25:36,819 INFO L87 Difference]: Start difference. First operand 855 states and 1111 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:37,206 INFO L93 Difference]: Finished difference Result 2293 states and 3074 transitions. [2022-07-23 00:25:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:25:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 169 [2022-07-23 00:25:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:37,213 INFO L225 Difference]: With dead ends: 2293 [2022-07-23 00:25:37,213 INFO L226 Difference]: Without dead ends: 1457 [2022-07-23 00:25:37,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:25:37,217 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 455 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:37,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1533 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 00:25:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-07-23 00:25:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 867. [2022-07-23 00:25:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 681 states have (on average 1.2657856093979443) internal successors, (862), 689 states have internal predecessors, (862), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-07-23 00:25:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1123 transitions. [2022-07-23 00:25:37,263 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1123 transitions. Word has length 169 [2022-07-23 00:25:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:37,264 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1123 transitions. [2022-07-23 00:25:37,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1123 transitions. [2022-07-23 00:25:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-23 00:25:37,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:37,268 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 00:25:37,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 00:25:37,269 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1080620452, now seen corresponding path program 1 times [2022-07-23 00:25:37,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:37,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515702890] [2022-07-23 00:25:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-23 00:25:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:25:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 00:25:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 00:25:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 00:25:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-23 00:25:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 00:25:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:25:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 00:25:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 00:25:37,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:37,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515702890] [2022-07-23 00:25:37,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515702890] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:37,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435347269] [2022-07-23 00:25:37,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:37,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:37,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:37,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:25:37,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 00:25:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:37,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 00:25:37,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 00:25:38,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:25:38,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435347269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:38,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:25:38,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-23 00:25:38,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338775983] [2022-07-23 00:25:38,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:38,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:38,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:38,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:38,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:25:38,054 INFO L87 Difference]: Start difference. First operand 867 states and 1123 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:38,257 INFO L93 Difference]: Finished difference Result 2809 states and 3672 transitions. [2022-07-23 00:25:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:25:38,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-07-23 00:25:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:38,266 INFO L225 Difference]: With dead ends: 2809 [2022-07-23 00:25:38,267 INFO L226 Difference]: Without dead ends: 1961 [2022-07-23 00:25:38,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-23 00:25:38,270 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 394 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:38,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1866 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 00:25:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2022-07-23 00:25:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 903. [2022-07-23 00:25:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 709 states have (on average 1.2552891396332864) internal successors, (890), 717 states have internal predecessors, (890), 138 states have call successors, (138), 56 states have call predecessors, (138), 55 states have return successors, (139), 137 states have call predecessors, (139), 137 states have call successors, (139) [2022-07-23 00:25:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1167 transitions. [2022-07-23 00:25:38,338 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1167 transitions. Word has length 171 [2022-07-23 00:25:38,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:38,338 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1167 transitions. [2022-07-23 00:25:38,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1167 transitions. [2022-07-23 00:25:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-23 00:25:38,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:38,341 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-23 00:25:38,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:38,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-23 00:25:38,560 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2091737702, now seen corresponding path program 1 times [2022-07-23 00:25:38,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:38,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004686249] [2022-07-23 00:25:38,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-23 00:25:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:25:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 00:25:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 00:25:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 00:25:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-23 00:25:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 00:25:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:25:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 00:25:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-23 00:25:38,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:38,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004686249] [2022-07-23 00:25:38,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004686249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:38,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304141155] [2022-07-23 00:25:38,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:38,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:38,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:38,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:25:38,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 00:25:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 00:25:39,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-23 00:25:39,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:25:39,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304141155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:39,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:25:39,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-07-23 00:25:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062628649] [2022-07-23 00:25:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:39,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:25:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:39,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:25:39,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:25:39,189 INFO L87 Difference]: Start difference. First operand 903 states and 1167 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:39,272 INFO L93 Difference]: Finished difference Result 1803 states and 2343 transitions. [2022-07-23 00:25:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:25:39,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-07-23 00:25:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:39,277 INFO L225 Difference]: With dead ends: 1803 [2022-07-23 00:25:39,277 INFO L226 Difference]: Without dead ends: 911 [2022-07-23 00:25:39,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:25:39,280 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:39,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 00:25:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-07-23 00:25:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 911. [2022-07-23 00:25:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.2538569424964936) internal successors, (894), 725 states have internal predecessors, (894), 138 states have call successors, (138), 56 states have call predecessors, (138), 59 states have return successors, (151), 137 states have call predecessors, (151), 137 states have call successors, (151) [2022-07-23 00:25:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1183 transitions. [2022-07-23 00:25:39,345 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1183 transitions. Word has length 171 [2022-07-23 00:25:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:39,345 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1183 transitions. [2022-07-23 00:25:39,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-23 00:25:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1183 transitions. [2022-07-23 00:25:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-23 00:25:39,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:39,350 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-07-23 00:25:39,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:39,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-23 00:25:39,564 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2083587314, now seen corresponding path program 1 times [2022-07-23 00:25:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:39,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205208800] [2022-07-23 00:25:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:25:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:25:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 00:25:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:25:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 00:25:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 00:25:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 00:25:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 00:25:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 00:25:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-23 00:25:39,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:39,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205208800] [2022-07-23 00:25:39,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205208800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:39,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622696510] [2022-07-23 00:25:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:39,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:39,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:39,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:25:39,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 00:25:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:40,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-23 00:25:40,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-23 00:25:40,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:25:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-23 00:25:40,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622696510] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:25:40,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:25:40,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2022-07-23 00:25:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980366609] [2022-07-23 00:25:40,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:25:40,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 00:25:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:40,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 00:25:40,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-07-23 00:25:40,622 INFO L87 Difference]: Start difference. First operand 911 states and 1183 transitions. Second operand has 20 states, 20 states have (on average 6.85) internal successors, (137), 12 states have internal predecessors, (137), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-23 00:25:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:41,628 INFO L93 Difference]: Finished difference Result 2037 states and 2676 transitions. [2022-07-23 00:25:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 00:25:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 12 states have internal predecessors, (137), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) Word has length 177 [2022-07-23 00:25:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:41,634 INFO L225 Difference]: With dead ends: 2037 [2022-07-23 00:25:41,634 INFO L226 Difference]: Without dead ends: 1145 [2022-07-23 00:25:41,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-07-23 00:25:41,637 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 141 mSDsluCounter, 3245 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:41,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 3569 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 00:25:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-07-23 00:25:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 951. [2022-07-23 00:25:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 745 states have (on average 1.2429530201342283) internal successors, (926), 753 states have internal predecessors, (926), 142 states have call successors, (142), 56 states have call predecessors, (142), 63 states have return successors, (167), 149 states have call predecessors, (167), 141 states have call successors, (167) [2022-07-23 00:25:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1235 transitions. [2022-07-23 00:25:41,707 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1235 transitions. Word has length 177 [2022-07-23 00:25:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:41,708 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1235 transitions. [2022-07-23 00:25:41,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 12 states have internal predecessors, (137), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-23 00:25:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1235 transitions. [2022-07-23 00:25:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-23 00:25:41,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:41,711 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:41,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:41,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:41,932 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1620349506, now seen corresponding path program 2 times [2022-07-23 00:25:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:41,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2635972] [2022-07-23 00:25:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:41,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:25:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:25:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 00:25:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 00:25:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:25:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 00:25:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:25:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 00:25:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 00:25:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-23 00:25:42,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:42,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2635972] [2022-07-23 00:25:42,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2635972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:42,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927196813] [2022-07-23 00:25:42,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 00:25:42,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:42,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:42,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:25:42,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 00:25:42,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 00:25:42,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 00:25:42,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 00:25:42,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-23 00:25:42,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:25:42,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927196813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:42,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:25:42,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-07-23 00:25:42,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991612336] [2022-07-23 00:25:42,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:42,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:25:42,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:42,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:25:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-23 00:25:42,654 INFO L87 Difference]: Start difference. First operand 951 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 00:25:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:43,017 INFO L93 Difference]: Finished difference Result 2075 states and 2732 transitions. [2022-07-23 00:25:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:25:43,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 183 [2022-07-23 00:25:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:43,024 INFO L225 Difference]: With dead ends: 2075 [2022-07-23 00:25:43,024 INFO L226 Difference]: Without dead ends: 1143 [2022-07-23 00:25:43,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-23 00:25:43,027 INFO L413 NwaCegarLoop]: 520 mSDtfsCounter, 725 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:43,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 2141 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:25:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-07-23 00:25:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 945. [2022-07-23 00:25:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 741 states have (on average 1.2415654520917678) internal successors, (920), 749 states have internal predecessors, (920), 140 states have call successors, (140), 56 states have call predecessors, (140), 63 states have return successors, (165), 147 states have call predecessors, (165), 139 states have call successors, (165) [2022-07-23 00:25:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1225 transitions. [2022-07-23 00:25:43,122 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1225 transitions. Word has length 183 [2022-07-23 00:25:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:43,123 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1225 transitions. [2022-07-23 00:25:43,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 00:25:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1225 transitions. [2022-07-23 00:25:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-23 00:25:43,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:43,141 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:43,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:43,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:43,358 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1006053722, now seen corresponding path program 1 times [2022-07-23 00:25:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:43,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410935305] [2022-07-23 00:25:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:43,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:25:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:25:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 00:25:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 00:25:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:25:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 00:25:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:25:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 00:25:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 00:25:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-23 00:25:43,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:43,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410935305] [2022-07-23 00:25:43,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410935305] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:43,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208850176] [2022-07-23 00:25:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:43,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:43,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:43,618 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:25:43,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 00:25:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:44,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 00:25:44,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 00:25:44,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:25:44,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208850176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:44,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:25:44,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-23 00:25:44,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707170764] [2022-07-23 00:25:44,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:44,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:25:44,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:44,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:25:44,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:25:44,247 INFO L87 Difference]: Start difference. First operand 945 states and 1225 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 00:25:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:44,650 INFO L93 Difference]: Finished difference Result 2799 states and 3638 transitions. [2022-07-23 00:25:44,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:25:44,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 202 [2022-07-23 00:25:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:44,664 INFO L225 Difference]: With dead ends: 2799 [2022-07-23 00:25:44,664 INFO L226 Difference]: Without dead ends: 2791 [2022-07-23 00:25:44,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:25:44,668 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 400 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:44,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1042 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:25:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-07-23 00:25:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2777. [2022-07-23 00:25:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2181 states have (on average 1.245300320953691) internal successors, (2716), 2209 states have internal predecessors, (2716), 412 states have call successors, (412), 160 states have call predecessors, (412), 183 states have return successors, (489), 431 states have call predecessors, (489), 411 states have call successors, (489) [2022-07-23 00:25:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3617 transitions. [2022-07-23 00:25:44,985 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3617 transitions. Word has length 202 [2022-07-23 00:25:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:44,986 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 3617 transitions. [2022-07-23 00:25:44,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 00:25:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3617 transitions. [2022-07-23 00:25:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-23 00:25:44,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:44,991 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:45,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 00:25:45,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-23 00:25:45,208 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2017170972, now seen corresponding path program 1 times [2022-07-23 00:25:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203384551] [2022-07-23 00:25:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:25:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:25:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 00:25:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 00:25:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:25:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 00:25:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:25:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 00:25:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 00:25:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-23 00:25:45,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:45,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203384551] [2022-07-23 00:25:45,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203384551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:25:45,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:25:45,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 00:25:45,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781793165] [2022-07-23 00:25:45,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:25:45,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 00:25:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:25:45,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 00:25:45,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:25:45,417 INFO L87 Difference]: Start difference. First operand 2777 states and 3617 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-23 00:25:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:25:46,666 INFO L93 Difference]: Finished difference Result 8799 states and 11542 transitions. [2022-07-23 00:25:46,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 00:25:46,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 202 [2022-07-23 00:25:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:25:46,693 INFO L225 Difference]: With dead ends: 8799 [2022-07-23 00:25:46,694 INFO L226 Difference]: Without dead ends: 6041 [2022-07-23 00:25:46,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-23 00:25:46,703 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 460 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 00:25:46,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1530 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 00:25:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2022-07-23 00:25:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 2789. [2022-07-23 00:25:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2193 states have (on average 1.2439580483356134) internal successors, (2728), 2225 states have internal predecessors, (2728), 412 states have call successors, (412), 160 states have call predecessors, (412), 183 states have return successors, (489), 427 states have call predecessors, (489), 411 states have call successors, (489) [2022-07-23 00:25:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3629 transitions. [2022-07-23 00:25:47,053 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3629 transitions. Word has length 202 [2022-07-23 00:25:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:25:47,056 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 3629 transitions. [2022-07-23 00:25:47,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-23 00:25:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3629 transitions. [2022-07-23 00:25:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-23 00:25:47,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:25:47,063 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:25:47,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 00:25:47,064 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:25:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:25:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1121007566, now seen corresponding path program 1 times [2022-07-23 00:25:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:25:47,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264711099] [2022-07-23 00:25:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:25:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:25:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:25:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:25:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:25:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:25:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 00:25:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:25:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 00:25:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:25:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:25:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 00:25:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:25:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 00:25:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-23 00:25:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 00:25:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-23 00:25:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:25:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264711099] [2022-07-23 00:25:47,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264711099] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:25:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691552379] [2022-07-23 00:25:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:25:47,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:25:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:25:47,444 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:25:47,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 00:25:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:25:47,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 112 conjunts are in the unsatisfiable core [2022-07-23 00:25:47,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:25:47,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:25:47,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-23 00:25:48,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:25:48,423 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1045 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1045))) is different from true [2022-07-23 00:25:48,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:25:48,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:25:48,545 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 00:25:48,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 00:25:48,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:25:48,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 00:25:56,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:26:08,891 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 00:26:08,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 00:26:09,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 00:26:25,568 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 00:26:25,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 00:26:50,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:14,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:14,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:26,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:26,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:27:26,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:27:26,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-07-23 00:27:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 59 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2022-07-23 00:27:26,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:27:26,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1055) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-07-23 00:27:26,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691552379] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:27:26,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:27:26,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 50 [2022-07-23 00:27:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840850931] [2022-07-23 00:27:26,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:27:26,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 00:27:26,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:27:26,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 00:27:26,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2182, Unknown=20, NotChecked=190, Total=2550 [2022-07-23 00:27:26,791 INFO L87 Difference]: Start difference. First operand 2789 states and 3629 transitions. Second operand has 50 states, 47 states have (on average 5.51063829787234) internal successors, (259), 36 states have internal predecessors, (259), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-23 00:28:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:28:53,787 INFO L93 Difference]: Finished difference Result 8338 states and 11184 transitions. [2022-07-23 00:28:53,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-23 00:28:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 5.51063829787234) internal successors, (259), 36 states have internal predecessors, (259), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) Word has length 209 [2022-07-23 00:28:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:28:53,853 INFO L225 Difference]: With dead ends: 8338 [2022-07-23 00:28:53,853 INFO L226 Difference]: Without dead ends: 5568 [2022-07-23 00:28:53,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 247 SyntacticMatches, 18 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 182.7s TimeCoverageRelationStatistics Valid=359, Invalid=5285, Unknown=64, NotChecked=298, Total=6006 [2022-07-23 00:28:53,863 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 659 mSDsluCounter, 12041 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 12572 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2594 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 00:28:53,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 12572 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2253 Invalid, 0 Unknown, 2594 Unchecked, 1.5s Time] [2022-07-23 00:28:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2022-07-23 00:28:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 3019. [2022-07-23 00:28:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2382 states have (on average 1.2472712006717044) internal successors, (2971), 2422 states have internal predecessors, (2971), 435 states have call successors, (435), 174 states have call predecessors, (435), 201 states have return successors, (518), 450 states have call predecessors, (518), 434 states have call successors, (518) [2022-07-23 00:28:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3924 transitions. [2022-07-23 00:28:54,203 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3924 transitions. Word has length 209 [2022-07-23 00:28:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:28:54,203 INFO L495 AbstractCegarLoop]: Abstraction has 3019 states and 3924 transitions. [2022-07-23 00:28:54,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 5.51063829787234) internal successors, (259), 36 states have internal predecessors, (259), 15 states have call successors, (39), 11 states have call predecessors, (39), 15 states have return successors, (39), 18 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-23 00:28:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3924 transitions. [2022-07-23 00:28:54,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-23 00:28:54,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:28:54,211 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1] [2022-07-23 00:28:54,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 00:28:54,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-23 00:28:54,440 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:28:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:28:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1619461338, now seen corresponding path program 2 times [2022-07-23 00:28:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:28:54,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983263543] [2022-07-23 00:28:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:28:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:28:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 00:28:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:28:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 00:28:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:28:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:28:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 00:28:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-23 00:28:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:28:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:28:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 00:28:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:28:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 00:28:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-23 00:28:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-23 00:28:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 00:28:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:28:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-23 00:28:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:28:54,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983263543] [2022-07-23 00:28:54,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983263543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:28:54,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873974056] [2022-07-23 00:28:54,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 00:28:54,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:28:54,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:28:54,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 00:28:54,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 00:28:59,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 00:28:59,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 00:28:59,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-23 00:28:59,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:28:59,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:28:59,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-23 00:28:59,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:28:59,523 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1338 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1338) |c_#memory_int|)) is different from true [2022-07-23 00:28:59,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:28:59,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:28:59,606 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 00:28:59,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 00:28:59,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-23 00:28:59,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 00:29:07,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:29:17,839 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 00:29:17,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 00:29:18,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 00:29:22,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-23 00:29:22,412 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 00:29:22,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 00:29:22,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 00:29:38,810 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 00:29:38,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 00:29:49,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15