./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0408b8dd1e50dba1d05ee8137dbd65dd8b8c61dcceb5e60c09fc08110798cce8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:11:37,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:11:37,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:11:37,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:11:37,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:11:37,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:11:37,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:11:37,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:11:37,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:11:37,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:11:37,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:11:37,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:11:37,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:11:37,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:11:37,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:11:37,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:11:37,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:11:37,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:11:37,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:11:37,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:11:37,389 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:11:37,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:11:37,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:11:37,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:11:37,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:11:37,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:11:37,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:11:37,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:11:37,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:11:37,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:11:37,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:11:37,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:11:37,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:11:37,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:11:37,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:11:37,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:11:37,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:11:37,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:11:37,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:11:37,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:11:37,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:11:37,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:11:37,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:11:37,428 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:11:37,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:11:37,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:11:37,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:11:37,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:11:37,433 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:11:37,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:11:37,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:11:37,434 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:11:37,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:11:37,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:11:37,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:11:37,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:11:37,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:11:37,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:11:37,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:11:37,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:11:37,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:11:37,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:11:37,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:11:37,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:11:37,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:11:37,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:11:37,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:11:37,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:11:37,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:11:37,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:11:37,439 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:11:37,439 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:11:37,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:11:37,439 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 -> 0408b8dd1e50dba1d05ee8137dbd65dd8b8c61dcceb5e60c09fc08110798cce8 [2022-07-14 00:11:37,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:11:37,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:11:37,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:11:37,682 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:11:37,682 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:11:37,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-07-14 00:11:37,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df01ccae/1c57eb00add046f59847975fde3cb558/FLAG9e7f7e5f5 [2022-07-14 00:11:38,307 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:11:38,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-07-14 00:11:38,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df01ccae/1c57eb00add046f59847975fde3cb558/FLAG9e7f7e5f5 [2022-07-14 00:11:38,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df01ccae/1c57eb00add046f59847975fde3cb558 [2022-07-14 00:11:38,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:11:38,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:11:38,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:11:38,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:11:38,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:11:38,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:11:38" (1/1) ... [2022-07-14 00:11:38,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c58645d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:38, skipping insertion in model container [2022-07-14 00:11:38,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:11:38" (1/1) ... [2022-07-14 00:11:38,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:11:38,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:11:39,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] [2022-07-14 00:11:39,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:11:39,436 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:11:39,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] [2022-07-14 00:11:39,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:11:39,652 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:11:39,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39 WrapperNode [2022-07-14 00:11:39,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:11:39,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:11:39,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:11:39,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:11:39,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,787 INFO L137 Inliner]: procedures = 88, calls = 403, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 1034 [2022-07-14 00:11:39,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:11:39,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:11:39,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:11:39,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:11:39,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:11:39,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:11:39,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:11:39,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:11:39,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (1/1) ... [2022-07-14 00:11:39,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:11:39,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:11:39,929 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-14 00:11:39,951 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-14 00:11:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-07-14 00:11:39,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-07-14 00:11:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:11:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure load_pkt [2022-07-14 00:11:39,964 INFO L138 BoogieDeclarations]: Found implementation of procedure load_pkt [2022-07-14 00:11:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 00:11:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:11:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:11:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:11:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:11:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:11:39,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:11:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:11:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:11:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-14 00:11:39,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-14 00:11:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 00:11:39,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 00:11:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:11:39,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:11:39,966 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2022-07-14 00:11:39,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2022-07-14 00:11:39,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:11:39,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:11:39,966 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-14 00:11:39,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-14 00:11:39,966 INFO L130 BoogieDeclarations]: Found specification of procedure type_trans [2022-07-14 00:11:39,966 INFO L138 BoogieDeclarations]: Found implementation of procedure type_trans [2022-07-14 00:11:39,967 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-14 00:11:39,967 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-14 00:11:39,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:11:39,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:11:39,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:11:39,967 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 00:11:39,967 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 00:11:39,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:11:39,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:11:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:11:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:11:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-14 00:11:39,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-14 00:11:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 00:11:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 00:11:39,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 00:11:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-14 00:11:39,969 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-14 00:11:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:11:39,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:11:40,171 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:11:40,173 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:11:40,442 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:11:40,934 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:11:40,941 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:11:40,941 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 00:11:40,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:11:40 BoogieIcfgContainer [2022-07-14 00:11:40,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:11:40,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:11:40,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:11:40,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:11:40,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:11:38" (1/3) ... [2022-07-14 00:11:40,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31acedd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:11:40, skipping insertion in model container [2022-07-14 00:11:40,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:11:39" (2/3) ... [2022-07-14 00:11:40,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31acedd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:11:40, skipping insertion in model container [2022-07-14 00:11:40,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:11:40" (3/3) ... [2022-07-14 00:11:40,949 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2022-07-14 00:11:40,957 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:11:40,958 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:11:40,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:11:40,996 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@34536b28, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c931e88 [2022-07-14 00:11:40,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:11:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 243 states have (on average 1.4444444444444444) internal successors, (351), 248 states have internal predecessors, (351), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-14 00:11:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 00:11:41,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:41,007 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] [2022-07-14 00:11:41,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash 722424881, now seen corresponding path program 1 times [2022-07-14 00:11:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:41,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199234545] [2022-07-14 00:11:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:41,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:41,217 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-14 00:11:41,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:41,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199234545] [2022-07-14 00:11:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199234545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:41,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:41,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:11:41,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862794776] [2022-07-14 00:11:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:41,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:11:41,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:41,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:11:41,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:11:41,242 INFO L87 Difference]: Start difference. First operand has 305 states, 243 states have (on average 1.4444444444444444) internal successors, (351), 248 states have internal predecessors, (351), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 00:11:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:41,875 INFO L93 Difference]: Finished difference Result 947 states and 1418 transitions. [2022-07-14 00:11:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:11:41,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-14 00:11:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:41,887 INFO L225 Difference]: With dead ends: 947 [2022-07-14 00:11:41,888 INFO L226 Difference]: Without dead ends: 633 [2022-07-14 00:11:41,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:11:41,894 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 503 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:41,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1034 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 00:11:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-07-14 00:11:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 565. [2022-07-14 00:11:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 456 states have (on average 1.4078947368421053) internal successors, (642), 456 states have internal predecessors, (642), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-07-14 00:11:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 801 transitions. [2022-07-14 00:11:41,950 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 801 transitions. Word has length 25 [2022-07-14 00:11:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:41,951 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 801 transitions. [2022-07-14 00:11:41,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 00:11:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 801 transitions. [2022-07-14 00:11:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 00:11:41,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:41,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:11:41,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:11:41,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:41,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1364109622, now seen corresponding path program 1 times [2022-07-14 00:11:41,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:41,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083255974] [2022-07-14 00:11:41,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:42,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:42,045 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-14 00:11:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:42,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083255974] [2022-07-14 00:11:42,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083255974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:42,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:42,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:11:42,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615625885] [2022-07-14 00:11:42,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:42,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:11:42,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:42,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:11:42,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:11:42,048 INFO L87 Difference]: Start difference. First operand 565 states and 801 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 00:11:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:42,715 INFO L93 Difference]: Finished difference Result 1189 states and 1695 transitions. [2022-07-14 00:11:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:11:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-14 00:11:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:42,719 INFO L225 Difference]: With dead ends: 1189 [2022-07-14 00:11:42,719 INFO L226 Difference]: Without dead ends: 632 [2022-07-14 00:11:42,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:11:42,722 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 701 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:42,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1320 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 00:11:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-07-14 00:11:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 564. [2022-07-14 00:11:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 455 states have (on average 1.402197802197802) internal successors, (638), 455 states have internal predecessors, (638), 80 states have call successors, (80), 29 states have call predecessors, (80), 28 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-07-14 00:11:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 797 transitions. [2022-07-14 00:11:42,744 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 797 transitions. Word has length 29 [2022-07-14 00:11:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:42,745 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 797 transitions. [2022-07-14 00:11:42,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 00:11:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 797 transitions. [2022-07-14 00:11:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 00:11:42,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:42,748 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-14 00:11:42,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:11:42,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2094845703, now seen corresponding path program 1 times [2022-07-14 00:11:42,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:42,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106152482] [2022-07-14 00:11:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:42,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:42,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:11:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:11:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 00:11:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:42,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106152482] [2022-07-14 00:11:42,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106152482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:42,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:42,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:11:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48009666] [2022-07-14 00:11:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:42,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:11:42,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:11:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:11:42,908 INFO L87 Difference]: Start difference. First operand 564 states and 797 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 00:11:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:43,552 INFO L93 Difference]: Finished difference Result 1799 states and 2590 transitions. [2022-07-14 00:11:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:11:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-07-14 00:11:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:43,560 INFO L225 Difference]: With dead ends: 1799 [2022-07-14 00:11:43,560 INFO L226 Difference]: Without dead ends: 1238 [2022-07-14 00:11:43,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:11:43,567 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 491 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:43,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1756 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 00:11:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-07-14 00:11:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1138. [2022-07-14 00:11:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 917 states have (on average 1.4034896401308614) internal successors, (1287), 919 states have internal predecessors, (1287), 158 states have call successors, (158), 57 states have call predecessors, (158), 62 states have return successors, (179), 161 states have call predecessors, (179), 157 states have call successors, (179) [2022-07-14 00:11:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1624 transitions. [2022-07-14 00:11:43,623 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1624 transitions. Word has length 50 [2022-07-14 00:11:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:43,625 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1624 transitions. [2022-07-14 00:11:43,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 00:11:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1624 transitions. [2022-07-14 00:11:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-14 00:11:43,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:43,634 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-14 00:11:43,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:11:43,637 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1094727353, now seen corresponding path program 1 times [2022-07-14 00:11:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:43,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480050002] [2022-07-14 00:11:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:11:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:11:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:43,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:11:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:11:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 00:11:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:43,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480050002] [2022-07-14 00:11:43,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480050002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:43,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:43,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:11:43,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712820180] [2022-07-14 00:11:43,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:43,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:11:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:11:43,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:11:43,820 INFO L87 Difference]: Start difference. First operand 1138 states and 1624 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 00:11:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:44,510 INFO L93 Difference]: Finished difference Result 1832 states and 2618 transitions. [2022-07-14 00:11:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:11:44,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 97 [2022-07-14 00:11:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:44,513 INFO L225 Difference]: With dead ends: 1832 [2022-07-14 00:11:44,513 INFO L226 Difference]: Without dead ends: 702 [2022-07-14 00:11:44,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:11:44,516 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 112 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:44,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1111 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 00:11:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-07-14 00:11:44,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 642. [2022-07-14 00:11:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 523 states have (on average 1.395793499043977) internal successors, (730), 525 states have internal predecessors, (730), 83 states have call successors, (83), 31 states have call predecessors, (83), 35 states have return successors, (97), 85 states have call predecessors, (97), 82 states have call successors, (97) [2022-07-14 00:11:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 910 transitions. [2022-07-14 00:11:44,534 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 910 transitions. Word has length 97 [2022-07-14 00:11:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:44,534 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 910 transitions. [2022-07-14 00:11:44,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 00:11:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 910 transitions. [2022-07-14 00:11:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-14 00:11:44,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:44,536 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-14 00:11:44,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:11:44,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:44,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -660311895, now seen corresponding path program 2 times [2022-07-14 00:11:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:44,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226765647] [2022-07-14 00:11:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:44,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:44,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:11:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:44,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:11:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:44,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:11:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:44,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 00:11:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:44,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-14 00:11:44,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:44,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226765647] [2022-07-14 00:11:44,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226765647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:44,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:44,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:11:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417887224] [2022-07-14 00:11:44,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:44,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:11:44,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:11:44,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:11:44,715 INFO L87 Difference]: Start difference. First operand 642 states and 910 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-14 00:11:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:45,332 INFO L93 Difference]: Finished difference Result 1288 states and 1855 transitions. [2022-07-14 00:11:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:11:45,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 97 [2022-07-14 00:11:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:45,335 INFO L225 Difference]: With dead ends: 1288 [2022-07-14 00:11:45,336 INFO L226 Difference]: Without dead ends: 678 [2022-07-14 00:11:45,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:11:45,337 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 98 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:45,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 2271 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:11:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-14 00:11:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 642. [2022-07-14 00:11:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 521 states have (on average 1.3896353166986564) internal successors, (724), 524 states have internal predecessors, (724), 83 states have call successors, (83), 31 states have call predecessors, (83), 37 states have return successors, (101), 86 states have call predecessors, (101), 82 states have call successors, (101) [2022-07-14 00:11:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 908 transitions. [2022-07-14 00:11:45,354 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 908 transitions. Word has length 97 [2022-07-14 00:11:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:45,355 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 908 transitions. [2022-07-14 00:11:45,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-14 00:11:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 908 transitions. [2022-07-14 00:11:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-14 00:11:45,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:45,356 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-14 00:11:45,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:11:45,357 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1628559102, now seen corresponding path program 1 times [2022-07-14 00:11:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:45,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163570969] [2022-07-14 00:11:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:11:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:45,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:11:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:45,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:11:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:45,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:11:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:45,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:11:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-14 00:11:45,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:45,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163570969] [2022-07-14 00:11:45,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163570969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:45,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:45,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 00:11:45,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760965554] [2022-07-14 00:11:45,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:45,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 00:11:45,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 00:11:45,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:11:45,545 INFO L87 Difference]: Start difference. First operand 642 states and 908 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-14 00:11:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:46,270 INFO L93 Difference]: Finished difference Result 1292 states and 1853 transitions. [2022-07-14 00:11:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 00:11:46,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 109 [2022-07-14 00:11:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:46,273 INFO L225 Difference]: With dead ends: 1292 [2022-07-14 00:11:46,273 INFO L226 Difference]: Without dead ends: 682 [2022-07-14 00:11:46,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:11:46,275 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 113 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:46,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 3309 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 00:11:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-07-14 00:11:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 646. [2022-07-14 00:11:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 524 states have (on average 1.381679389312977) internal successors, (724), 526 states have internal predecessors, (724), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-07-14 00:11:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 910 transitions. [2022-07-14 00:11:46,292 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 910 transitions. Word has length 109 [2022-07-14 00:11:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:46,292 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 910 transitions. [2022-07-14 00:11:46,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-14 00:11:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 910 transitions. [2022-07-14 00:11:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-14 00:11:46,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:46,294 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:11:46,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:11:46,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:46,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash -556686604, now seen corresponding path program 1 times [2022-07-14 00:11:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:46,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932876307] [2022-07-14 00:11:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:11:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 00:11:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:11:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:11:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:11:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:11:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 00:11:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:46,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932876307] [2022-07-14 00:11:46,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932876307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:46,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:46,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:11:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603036789] [2022-07-14 00:11:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:46,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:11:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:46,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:11:46,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:11:46,458 INFO L87 Difference]: Start difference. First operand 646 states and 910 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 00:11:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:46,896 INFO L93 Difference]: Finished difference Result 1347 states and 1922 transitions. [2022-07-14 00:11:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:11:46,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2022-07-14 00:11:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:46,899 INFO L225 Difference]: With dead ends: 1347 [2022-07-14 00:11:46,899 INFO L226 Difference]: Without dead ends: 719 [2022-07-14 00:11:46,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:11:46,901 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 140 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:46,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1214 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:11:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-07-14 00:11:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 647. [2022-07-14 00:11:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 525 states have (on average 1.380952380952381) internal successors, (725), 527 states have internal predecessors, (725), 84 states have call successors, (84), 31 states have call predecessors, (84), 37 states have return successors, (102), 88 states have call predecessors, (102), 83 states have call successors, (102) [2022-07-14 00:11:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 911 transitions. [2022-07-14 00:11:46,916 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 911 transitions. Word has length 115 [2022-07-14 00:11:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:46,917 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 911 transitions. [2022-07-14 00:11:46,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 00:11:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 911 transitions. [2022-07-14 00:11:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-14 00:11:46,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:46,918 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-14 00:11:46,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:11:46,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1428826331, now seen corresponding path program 1 times [2022-07-14 00:11:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:46,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351037138] [2022-07-14 00:11:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:11:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:11:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:11:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 00:11:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:11:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:11:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 00:11:47,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:47,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351037138] [2022-07-14 00:11:47,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351037138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:47,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:47,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-14 00:11:47,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116980287] [2022-07-14 00:11:47,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:47,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 00:11:47,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 00:11:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-14 00:11:47,399 INFO L87 Difference]: Start difference. First operand 647 states and 911 transitions. Second operand has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-14 00:11:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:49,301 INFO L93 Difference]: Finished difference Result 1567 states and 2276 transitions. [2022-07-14 00:11:49,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 00:11:49,303 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 111 [2022-07-14 00:11:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:49,307 INFO L225 Difference]: With dead ends: 1567 [2022-07-14 00:11:49,307 INFO L226 Difference]: Without dead ends: 953 [2022-07-14 00:11:49,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-14 00:11:49,309 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 237 mSDsluCounter, 7463 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 8017 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:49,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 8017 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-14 00:11:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-14 00:11:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 656. [2022-07-14 00:11:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 532 states have (on average 1.3759398496240602) internal successors, (732), 533 states have internal predecessors, (732), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 91 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-14 00:11:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 922 transitions. [2022-07-14 00:11:49,337 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 922 transitions. Word has length 111 [2022-07-14 00:11:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:49,338 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 922 transitions. [2022-07-14 00:11:49,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-14 00:11:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 922 transitions. [2022-07-14 00:11:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-14 00:11:49,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:49,342 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-14 00:11:49,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:11:49,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:49,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash -363635253, now seen corresponding path program 1 times [2022-07-14 00:11:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:49,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078613914] [2022-07-14 00:11:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:11:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:11:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:11:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:11:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:11:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:11:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 00:11:49,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:49,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078613914] [2022-07-14 00:11:49,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078613914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:49,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:49,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:11:49,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696836132] [2022-07-14 00:11:49,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:49,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:11:49,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:49,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:11:49,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:11:49,568 INFO L87 Difference]: Start difference. First operand 656 states and 922 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 00:11:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:50,891 INFO L93 Difference]: Finished difference Result 1520 states and 2195 transitions. [2022-07-14 00:11:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:11:50,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2022-07-14 00:11:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:50,895 INFO L225 Difference]: With dead ends: 1520 [2022-07-14 00:11:50,895 INFO L226 Difference]: Without dead ends: 897 [2022-07-14 00:11:50,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:11:50,897 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 186 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:50,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1911 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 00:11:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-07-14 00:11:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 664. [2022-07-14 00:11:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 540 states have (on average 1.3777777777777778) internal successors, (744), 541 states have internal predecessors, (744), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 91 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-14 00:11:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 934 transitions. [2022-07-14 00:11:50,927 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 934 transitions. Word has length 116 [2022-07-14 00:11:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:50,928 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 934 transitions. [2022-07-14 00:11:50,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 00:11:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 934 transitions. [2022-07-14 00:11:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-14 00:11:50,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:50,930 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-14 00:11:50,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:11:50,930 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash -161811319, now seen corresponding path program 1 times [2022-07-14 00:11:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:50,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037934015] [2022-07-14 00:11:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:11:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:11:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:11:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:11:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:11:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:11:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 00:11:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:51,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037934015] [2022-07-14 00:11:51,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037934015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:51,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:51,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-14 00:11:51,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128211414] [2022-07-14 00:11:51,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:51,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 00:11:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:51,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 00:11:51,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-14 00:11:51,549 INFO L87 Difference]: Start difference. First operand 664 states and 934 transitions. Second operand has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-14 00:11:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:52,653 INFO L93 Difference]: Finished difference Result 1386 states and 1981 transitions. [2022-07-14 00:11:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 00:11:52,654 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 116 [2022-07-14 00:11:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:52,656 INFO L225 Difference]: With dead ends: 1386 [2022-07-14 00:11:52,656 INFO L226 Difference]: Without dead ends: 755 [2022-07-14 00:11:52,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-14 00:11:52,658 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 214 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 5139 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:52,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 5139 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 00:11:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-07-14 00:11:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 668. [2022-07-14 00:11:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 544 states have (on average 1.375) internal successors, (748), 543 states have internal predecessors, (748), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 93 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-14 00:11:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 938 transitions. [2022-07-14 00:11:52,719 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 938 transitions. Word has length 116 [2022-07-14 00:11:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:52,720 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 938 transitions. [2022-07-14 00:11:52,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-14 00:11:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 938 transitions. [2022-07-14 00:11:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-14 00:11:52,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:52,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-14 00:11:52,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 00:11:52,722 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:52,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1915934418, now seen corresponding path program 1 times [2022-07-14 00:11:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:52,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604004537] [2022-07-14 00:11:52,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:52,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:11:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:11:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:11:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:11:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:11:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:11:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:11:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 00:11:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:52,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604004537] [2022-07-14 00:11:52,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604004537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:52,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:52,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:11:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575999399] [2022-07-14 00:11:52,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:52,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:11:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:52,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:11:52,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:11:52,844 INFO L87 Difference]: Start difference. First operand 668 states and 938 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-14 00:11:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:53,613 INFO L93 Difference]: Finished difference Result 1067 states and 1523 transitions. [2022-07-14 00:11:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:11:53,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 121 [2022-07-14 00:11:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:53,624 INFO L225 Difference]: With dead ends: 1067 [2022-07-14 00:11:53,626 INFO L226 Difference]: Without dead ends: 741 [2022-07-14 00:11:53,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:11:53,630 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 202 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:53,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1400 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 00:11:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-14 00:11:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 670. [2022-07-14 00:11:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 546 states have (on average 1.3736263736263736) internal successors, (750), 545 states have internal predecessors, (750), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (105), 93 states have call predecessors, (105), 84 states have call successors, (105) [2022-07-14 00:11:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 940 transitions. [2022-07-14 00:11:53,685 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 940 transitions. Word has length 121 [2022-07-14 00:11:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:53,686 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 940 transitions. [2022-07-14 00:11:53,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-14 00:11:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 940 transitions. [2022-07-14 00:11:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-14 00:11:53,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:53,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-14 00:11:53,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 00:11:53,689 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:53,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1115994769, now seen corresponding path program 1 times [2022-07-14 00:11:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:53,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472589718] [2022-07-14 00:11:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:11:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:11:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:11:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:11:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:11:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:11:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:11:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 00:11:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:54,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472589718] [2022-07-14 00:11:54,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472589718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:54,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:54,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 00:11:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084260966] [2022-07-14 00:11:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:54,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 00:11:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:54,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 00:11:54,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:11:54,006 INFO L87 Difference]: Start difference. First operand 670 states and 940 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-14 00:11:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:56,065 INFO L93 Difference]: Finished difference Result 1415 states and 2001 transitions. [2022-07-14 00:11:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 00:11:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 123 [2022-07-14 00:11:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:56,068 INFO L225 Difference]: With dead ends: 1415 [2022-07-14 00:11:56,068 INFO L226 Difference]: Without dead ends: 778 [2022-07-14 00:11:56,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2022-07-14 00:11:56,071 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 989 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:56,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1646 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-14 00:11:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-07-14 00:11:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 688. [2022-07-14 00:11:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 558 states have (on average 1.3620071684587813) internal successors, (760), 558 states have internal predecessors, (760), 88 states have call successors, (88), 33 states have call predecessors, (88), 41 states have return successors, (106), 96 states have call predecessors, (106), 87 states have call successors, (106) [2022-07-14 00:11:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 954 transitions. [2022-07-14 00:11:56,123 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 954 transitions. Word has length 123 [2022-07-14 00:11:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:56,123 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 954 transitions. [2022-07-14 00:11:56,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-14 00:11:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 954 transitions. [2022-07-14 00:11:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-14 00:11:56,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:56,125 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:11:56,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 00:11:56,125 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:56,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1527207652, now seen corresponding path program 1 times [2022-07-14 00:11:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:56,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265627640] [2022-07-14 00:11:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:56,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:11:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:11:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:11:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:11:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:11:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:11:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:11:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 00:11:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:11:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:11:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 00:11:56,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:56,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265627640] [2022-07-14 00:11:56,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265627640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:56,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:56,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:11:56,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112633559] [2022-07-14 00:11:56,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:56,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:11:56,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:11:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:11:56,415 INFO L87 Difference]: Start difference. First operand 688 states and 954 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 00:11:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:11:57,845 INFO L93 Difference]: Finished difference Result 1617 states and 2297 transitions. [2022-07-14 00:11:57,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:11:57,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2022-07-14 00:11:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:11:57,849 INFO L225 Difference]: With dead ends: 1617 [2022-07-14 00:11:57,850 INFO L226 Difference]: Without dead ends: 962 [2022-07-14 00:11:57,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:11:57,853 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 306 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:11:57,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1789 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-14 00:11:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-07-14 00:11:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 684. [2022-07-14 00:11:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 556 states have (on average 1.3597122302158273) internal successors, (756), 556 states have internal predecessors, (756), 86 states have call successors, (86), 33 states have call predecessors, (86), 41 states have return successors, (104), 94 states have call predecessors, (104), 85 states have call successors, (104) [2022-07-14 00:11:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 946 transitions. [2022-07-14 00:11:57,917 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 946 transitions. Word has length 139 [2022-07-14 00:11:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:11:57,917 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 946 transitions. [2022-07-14 00:11:57,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 00:11:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 946 transitions. [2022-07-14 00:11:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-14 00:11:57,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:11:57,920 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:11:57,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 00:11:57,920 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:11:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:11:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1475201316, now seen corresponding path program 1 times [2022-07-14 00:11:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:11:57,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221893042] [2022-07-14 00:11:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:11:57,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:11:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:11:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:11:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:11:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:11:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:11:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:11:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:11:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:11:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:11:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 00:11:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:11:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:11:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:11:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 00:11:58,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:11:58,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221893042] [2022-07-14 00:11:58,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221893042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:11:58,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:11:58,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:11:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124804417] [2022-07-14 00:11:58,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:11:58,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:11:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:11:58,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:11:58,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:11:58,304 INFO L87 Difference]: Start difference. First operand 684 states and 946 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-14 00:12:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:12:00,060 INFO L93 Difference]: Finished difference Result 1619 states and 2299 transitions. [2022-07-14 00:12:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 00:12:00,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 139 [2022-07-14 00:12:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:12:00,065 INFO L225 Difference]: With dead ends: 1619 [2022-07-14 00:12:00,075 INFO L226 Difference]: Without dead ends: 968 [2022-07-14 00:12:00,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:12:00,077 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 224 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-14 00:12:00,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2647 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-14 00:12:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-14 00:12:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 692. [2022-07-14 00:12:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 562 states have (on average 1.3629893238434163) internal successors, (766), 564 states have internal predecessors, (766), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-14 00:12:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 960 transitions. [2022-07-14 00:12:00,140 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 960 transitions. Word has length 139 [2022-07-14 00:12:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:12:00,141 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 960 transitions. [2022-07-14 00:12:00,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-14 00:12:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 960 transitions. [2022-07-14 00:12:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-14 00:12:00,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:12:00,144 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-14 00:12:00,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 00:12:00,144 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:12:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:12:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1269181933, now seen corresponding path program 1 times [2022-07-14 00:12:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:12:00,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914654580] [2022-07-14 00:12:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:12:00,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:12:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:12:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:12:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:12:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:12:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:12:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:12:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:12:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:12:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:12:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:12:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:12:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:00,572 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 00:12:00,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:12:00,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914654580] [2022-07-14 00:12:00,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914654580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:12:00,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288377943] [2022-07-14 00:12:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:12:00,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:12:00,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:12:00,583 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-14 00:12:00,625 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-14 00:12:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:01,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 00:12:01,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:12:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 00:12:01,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:12:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 00:12:01,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288377943] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 00:12:01,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:12:01,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 11 [2022-07-14 00:12:01,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422570425] [2022-07-14 00:12:01,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:12:01,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:12:01,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:12:01,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:12:01,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:12:01,481 INFO L87 Difference]: Start difference. First operand 692 states and 960 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 00:12:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:12:01,600 INFO L93 Difference]: Finished difference Result 1359 states and 1901 transitions. [2022-07-14 00:12:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:12:01,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 140 [2022-07-14 00:12:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:12:01,603 INFO L225 Difference]: With dead ends: 1359 [2022-07-14 00:12:01,603 INFO L226 Difference]: Without dead ends: 700 [2022-07-14 00:12:01,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:12:01,607 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 3 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:12:01,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 815 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 00:12:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-07-14 00:12:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 694. [2022-07-14 00:12:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 564 states have (on average 1.3617021276595744) internal successors, (768), 566 states have internal predecessors, (768), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-14 00:12:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 962 transitions. [2022-07-14 00:12:01,678 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 962 transitions. Word has length 140 [2022-07-14 00:12:01,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:12:01,678 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 962 transitions. [2022-07-14 00:12:01,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 00:12:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 962 transitions. [2022-07-14 00:12:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-14 00:12:01,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:12:01,680 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:12:01,715 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-14 00:12:01,895 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,SelfDestructingSolverStorable14 [2022-07-14 00:12:01,895 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:12:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:12:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 316514682, now seen corresponding path program 1 times [2022-07-14 00:12:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:12:01,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647604884] [2022-07-14 00:12:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:12:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:12:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:12:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:12:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:12:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:12:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:12:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:12:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:12:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:12:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 00:12:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:12:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 00:12:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:02,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:12:02,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647604884] [2022-07-14 00:12:02,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647604884] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:12:02,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027469234] [2022-07-14 00:12:02,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:12:02,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:12:02,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:12:02,376 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-14 00:12:02,435 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-14 00:12:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:03,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 00:12:03,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:12:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:03,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:12:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:03,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027469234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:12:03,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:12:03,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2022-07-14 00:12:03,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048387102] [2022-07-14 00:12:03,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:12:03,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 00:12:03,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:12:03,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 00:12:03,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:12:03,584 INFO L87 Difference]: Start difference. First operand 694 states and 962 transitions. Second operand has 15 states, 15 states have (on average 8.2) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-14 00:12:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:12:05,836 INFO L93 Difference]: Finished difference Result 1641 states and 2331 transitions. [2022-07-14 00:12:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 00:12:05,837 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.2) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2022-07-14 00:12:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:12:05,840 INFO L225 Difference]: With dead ends: 1641 [2022-07-14 00:12:05,840 INFO L226 Difference]: Without dead ends: 980 [2022-07-14 00:12:05,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-07-14 00:12:05,842 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 398 mSDsluCounter, 3538 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 4052 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:12:05,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 4052 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-14 00:12:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-07-14 00:12:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 698. [2022-07-14 00:12:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 568 states have (on average 1.3626760563380282) internal successors, (774), 570 states have internal predecessors, (774), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-14 00:12:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 968 transitions. [2022-07-14 00:12:05,946 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 968 transitions. Word has length 141 [2022-07-14 00:12:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:12:05,946 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 968 transitions. [2022-07-14 00:12:05,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.2) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-14 00:12:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 968 transitions. [2022-07-14 00:12:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-14 00:12:05,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:12:05,952 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:12:06,012 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-14 00:12:06,167 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,SelfDestructingSolverStorable15 [2022-07-14 00:12:06,167 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:12:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:12:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash 558897227, now seen corresponding path program 2 times [2022-07-14 00:12:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:12:06,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878778819] [2022-07-14 00:12:06,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:12:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:12:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:12:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:12:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:12:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:12:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:12:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:12:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:12:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:12:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:12:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:12:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 00:12:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:06,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:12:06,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878778819] [2022-07-14 00:12:06,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878778819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:12:06,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770499436] [2022-07-14 00:12:06,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:12:06,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:12:06,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:12:06,700 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-14 00:12:06,727 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-14 00:12:07,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:12:07,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:12:07,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 00:12:07,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:12:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:07,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:12:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:08,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770499436] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:12:08,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:12:08,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 18 [2022-07-14 00:12:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768123279] [2022-07-14 00:12:08,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:12:08,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 00:12:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:12:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 00:12:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:12:08,186 INFO L87 Difference]: Start difference. First operand 698 states and 968 transitions. Second operand has 18 states, 18 states have (on average 7.0) internal successors, (126), 14 states have internal predecessors, (126), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-14 00:12:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:12:10,456 INFO L93 Difference]: Finished difference Result 1655 states and 2353 transitions. [2022-07-14 00:12:10,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 00:12:10,456 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.0) internal successors, (126), 14 states have internal predecessors, (126), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2022-07-14 00:12:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:12:10,460 INFO L225 Difference]: With dead ends: 1655 [2022-07-14 00:12:10,460 INFO L226 Difference]: Without dead ends: 990 [2022-07-14 00:12:10,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2022-07-14 00:12:10,463 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 378 mSDsluCounter, 4418 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 4932 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:12:10,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 4932 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 00:12:10,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-07-14 00:12:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 700. [2022-07-14 00:12:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 570 states have (on average 1.3649122807017544) internal successors, (778), 572 states have internal predecessors, (778), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-14 00:12:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 972 transitions. [2022-07-14 00:12:10,557 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 972 transitions. Word has length 142 [2022-07-14 00:12:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:12:10,558 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 972 transitions. [2022-07-14 00:12:10,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.0) internal successors, (126), 14 states have internal predecessors, (126), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-14 00:12:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 972 transitions. [2022-07-14 00:12:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-14 00:12:10,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:12:10,560 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-14 00:12:10,605 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-14 00:12:10,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:12:10,776 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:12:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:12:10,777 INFO L85 PathProgramCache]: Analyzing trace with hash -517178470, now seen corresponding path program 3 times [2022-07-14 00:12:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:12:10,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278021645] [2022-07-14 00:12:10,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:12:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:12:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:12:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:12:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:12:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:12:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:12:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:12:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:12:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:12:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 00:12:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:12:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:12:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:12:11,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278021645] [2022-07-14 00:12:11,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278021645] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:12:11,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275512352] [2022-07-14 00:12:11,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 00:12:11,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:12:11,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:12:11,424 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-14 00:12:11,454 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-14 00:12:21,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-14 00:12:21,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:12:21,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 00:12:21,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:12:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:21,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:12:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:21,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275512352] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:12:21,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:12:21,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 21 [2022-07-14 00:12:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849872728] [2022-07-14 00:12:21,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:12:21,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 00:12:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:12:21,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 00:12:21,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-07-14 00:12:21,735 INFO L87 Difference]: Start difference. First operand 700 states and 972 transitions. Second operand has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 17 states have internal predecessors, (129), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-14 00:12:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:12:25,419 INFO L93 Difference]: Finished difference Result 1667 states and 2373 transitions. [2022-07-14 00:12:25,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 00:12:25,421 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 17 states have internal predecessors, (129), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 143 [2022-07-14 00:12:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:12:25,425 INFO L225 Difference]: With dead ends: 1667 [2022-07-14 00:12:25,425 INFO L226 Difference]: Without dead ends: 1000 [2022-07-14 00:12:25,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 295 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2022-07-14 00:12:25,427 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 322 mSDsluCounter, 4488 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 5003 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:12:25,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 5003 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-14 00:12:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-07-14 00:12:25,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 702. [2022-07-14 00:12:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 572 states have (on average 1.367132867132867) internal successors, (782), 574 states have internal predecessors, (782), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-14 00:12:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 976 transitions. [2022-07-14 00:12:25,462 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 976 transitions. Word has length 143 [2022-07-14 00:12:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:12:25,462 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 976 transitions. [2022-07-14 00:12:25,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 17 states have internal predecessors, (129), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-14 00:12:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 976 transitions. [2022-07-14 00:12:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-14 00:12:25,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:12:25,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2022-07-14 00:12:25,481 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-14 00:12:25,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 00:12:25,684 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:12:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:12:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash 484213291, now seen corresponding path program 4 times [2022-07-14 00:12:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:12:25,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052194130] [2022-07-14 00:12:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:12:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:12:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:12:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:12:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:12:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:12:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:12:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:12:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:12:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:12:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:12:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:12:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 00:12:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:26,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:12:26,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052194130] [2022-07-14 00:12:26,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052194130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:12:26,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166395780] [2022-07-14 00:12:26,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 00:12:26,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:12:26,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:12:26,423 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-14 00:12:26,459 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-14 00:12:29,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 00:12:29,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:12:29,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 00:12:29,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:12:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 00:12:29,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:12:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:30,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166395780] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:12:30,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:12:30,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 24 [2022-07-14 00:12:30,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512432451] [2022-07-14 00:12:30,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:12:30,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 00:12:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:12:30,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 00:12:30,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2022-07-14 00:12:30,030 INFO L87 Difference]: Start difference. First operand 702 states and 976 transitions. Second operand has 24 states, 24 states have (on average 5.5) internal successors, (132), 20 states have internal predecessors, (132), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-14 00:12:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:12:33,360 INFO L93 Difference]: Finished difference Result 1681 states and 2397 transitions. [2022-07-14 00:12:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 00:12:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 20 states have internal predecessors, (132), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2022-07-14 00:12:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:12:33,365 INFO L225 Difference]: With dead ends: 1681 [2022-07-14 00:12:33,365 INFO L226 Difference]: Without dead ends: 1012 [2022-07-14 00:12:33,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 295 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2022-07-14 00:12:33,368 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 476 mSDsluCounter, 5744 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 6259 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:12:33,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 6259 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1826 Invalid, 0 Unknown, 3 Unchecked, 2.5s Time] [2022-07-14 00:12:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2022-07-14 00:12:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 704. [2022-07-14 00:12:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 574 states have (on average 1.3693379790940767) internal successors, (786), 576 states have internal predecessors, (786), 86 states have call successors, (86), 33 states have call predecessors, (86), 43 states have return successors, (108), 94 states have call predecessors, (108), 85 states have call successors, (108) [2022-07-14 00:12:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 980 transitions. [2022-07-14 00:12:33,406 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 980 transitions. Word has length 144 [2022-07-14 00:12:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:12:33,407 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 980 transitions. [2022-07-14 00:12:33,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 20 states have internal predecessors, (132), 4 states have call successors, (28), 6 states have call predecessors, (28), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-14 00:12:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 980 transitions. [2022-07-14 00:12:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-14 00:12:33,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:12:33,409 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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] [2022-07-14 00:12:33,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-14 00:12:33,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:12:33,636 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:12:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:12:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1462586810, now seen corresponding path program 5 times [2022-07-14 00:12:33,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:12:33,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918503810] [2022-07-14 00:12:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:12:33,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:12:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:12:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:12:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:12:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:12:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 00:12:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:12:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:12:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:12:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:33,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:12:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:12:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:12:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:12:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:12:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 00:12:34,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:12:34,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918503810] [2022-07-14 00:12:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918503810] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:12:34,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770348825] [2022-07-14 00:12:34,109 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 00:12:34,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:12:34,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:12:34,111 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-14 00:12:34,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process