./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.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 6e17534f736f8f0727327ccce9421d9a9e89801b3a6ab68095fc479caa060175 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 23:24:12,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:24:12,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:24:12,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:24:12,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:24:12,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:24:12,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:24:12,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:24:12,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:24:12,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:24:12,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:24:12,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:24:12,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:24:12,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:24:12,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:24:12,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:24:12,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:24:12,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:24:12,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:24:12,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:24:12,321 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:24:12,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:24:12,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:24:12,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:24:12,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:24:12,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:24:12,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:24:12,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:24:12,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:24:12,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:24:12,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:24:12,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:24:12,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:24:12,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:24:12,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:24:12,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:24:12,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:24:12,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:24:12,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:24:12,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:24:12,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:24:12,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:24:12,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 23:24:12,358 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:24:12,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:24:12,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:24:12,359 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:24:12,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:24:12,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:24:12,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:24:12,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:24:12,361 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:24:12,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:24:12,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 23:24:12,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:24:12,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:24:12,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:24:12,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:24:12,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:24:12,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:24:12,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:24:12,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:24:12,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:24:12,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:24:12,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:24:12,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:24:12,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:24:12,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:24:12,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 23:24:12,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 23:24:12,365 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:24:12,365 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:24:12,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:24:12,365 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 -> 6e17534f736f8f0727327ccce9421d9a9e89801b3a6ab68095fc479caa060175 [2022-07-13 23:24:12,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:24:12,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:24:12,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:24:12,558 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:24:12,558 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:24:12,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-07-13 23:24:12,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95fa3d55/4d66fc089336465a9bb95ef123327034/FLAGd5787debd [2022-07-13 23:24:13,117 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:24:13,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-07-13 23:24:13,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95fa3d55/4d66fc089336465a9bb95ef123327034/FLAGd5787debd [2022-07-13 23:24:13,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95fa3d55/4d66fc089336465a9bb95ef123327034 [2022-07-13 23:24:13,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:24:13,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:24:13,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:24:13,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:24:13,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:24:13,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:24:13" (1/1) ... [2022-07-13 23:24:13,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68933b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:13, skipping insertion in model container [2022-07-13 23:24:13,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:24:13" (1/1) ... [2022-07-13 23:24:13,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:24:13,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:24:14,162 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2022-07-13 23:24:14,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:24:14,190 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:24:14,353 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2022-07-13 23:24:14,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:24:14,497 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:24:14,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14 WrapperNode [2022-07-13 23:24:14,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:24:14,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:24:14,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:24:14,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:24:14,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,635 INFO L137 Inliner]: procedures = 157, calls = 810, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2783 [2022-07-13 23:24:14,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:24:14,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:24:14,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:24:14,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:24:14,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:24:14,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:24:14,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:24:14,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:24:14,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (1/1) ... [2022-07-13 23:24:14,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:24:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:24:14,810 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-13 23:24:14,815 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-13 23:24:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 23:24:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-13 23:24:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 23:24:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 23:24:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 23:24:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-13 23:24:14,836 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-13 23:24:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-13 23:24:14,836 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-13 23:24:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-13 23:24:14,836 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-13 23:24:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-13 23:24:14,836 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-13 23:24:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-13 23:24:14,837 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-13 23:24:14,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:24:14,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:24:14,837 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-13 23:24:14,837 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-13 23:24:14,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-07-13 23:24:14,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-07-13 23:24:14,837 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-13 23:24:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-13 23:24:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 23:24:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 23:24:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-13 23:24:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-13 23:24:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 23:24:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-13 23:24:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-13 23:24:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-13 23:24:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-13 23:24:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-13 23:24:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-13 23:24:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-13 23:24:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-13 23:24:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-13 23:24:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-13 23:24:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-13 23:24:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-13 23:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-13 23:24:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-13 23:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-13 23:24:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-13 23:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:24:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-13 23:24:14,841 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-13 23:24:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-13 23:24:14,841 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-13 23:24:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:24:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:24:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-13 23:24:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-13 23:24:14,841 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-13 23:24:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:24:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-13 23:24:14,843 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-13 23:24:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-13 23:24:14,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-13 23:24:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-13 23:24:14,844 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-13 23:24:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-13 23:24:14,844 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-13 23:24:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-13 23:24:14,844 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-13 23:24:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:24:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-13 23:24:14,844 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-13 23:24:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:24:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-13 23:24:14,845 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-13 23:24:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-13 23:24:14,845 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-13 23:24:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-13 23:24:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-13 23:24:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-13 23:24:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-13 23:24:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-13 23:24:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-13 23:24:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-13 23:24:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-13 23:24:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-13 23:24:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-13 23:24:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-13 23:24:14,847 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-13 23:24:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-13 23:24:14,847 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-13 23:24:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 23:24:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-13 23:24:14,847 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-13 23:24:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-07-13 23:24:14,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-07-13 23:24:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-13 23:24:14,848 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-13 23:24:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-13 23:24:14,849 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-13 23:24:14,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 23:24:14,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:24:14,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:24:14,849 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-13 23:24:14,850 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-13 23:24:14,850 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-13 23:24:14,850 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-13 23:24:15,256 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:24:15,259 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:24:16,763 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:24:16,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:24:16,776 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 23:24:16,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:24:16 BoogieIcfgContainer [2022-07-13 23:24:16,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:24:16,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:24:16,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:24:16,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:24:16,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:24:13" (1/3) ... [2022-07-13 23:24:16,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b67549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:24:16, skipping insertion in model container [2022-07-13 23:24:16,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:24:14" (2/3) ... [2022-07-13 23:24:16,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b67549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:24:16, skipping insertion in model container [2022-07-13 23:24:16,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:24:16" (3/3) ... [2022-07-13 23:24:16,801 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-07-13 23:24:16,810 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:24:16,810 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:24:16,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:24:16,867 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@188a63a5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27b9b840 [2022-07-13 23:24:16,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:24:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 968 states, 716 states have (on average 1.4329608938547487) internal successors, (1026), 743 states have internal predecessors, (1026), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2022-07-13 23:24:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 23:24:16,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:16,883 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:24:16,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:16,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:16,887 INFO L85 PathProgramCache]: Analyzing trace with hash -579474216, now seen corresponding path program 1 times [2022-07-13 23:24:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:16,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469212028] [2022-07-13 23:24:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:16,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:17,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:24:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 23:24:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:17,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469212028] [2022-07-13 23:24:17,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469212028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:17,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:17,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:24:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889972609] [2022-07-13 23:24:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:17,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:24:17,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:17,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:24:17,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:24:17,312 INFO L87 Difference]: Start difference. First operand has 968 states, 716 states have (on average 1.4329608938547487) internal successors, (1026), 743 states have internal predecessors, (1026), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 23:24:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:18,179 INFO L93 Difference]: Finished difference Result 1950 states and 2923 transitions. [2022-07-13 23:24:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:24:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-07-13 23:24:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:18,201 INFO L225 Difference]: With dead ends: 1950 [2022-07-13 23:24:18,201 INFO L226 Difference]: Without dead ends: 947 [2022-07-13 23:24:18,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-13 23:24:18,217 INFO L413 NwaCegarLoop]: 1376 mSDtfsCounter, 1573 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:18,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 1984 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 23:24:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-13 23:24:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-07-13 23:24:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 686 states have (on average 1.4183673469387754) internal successors, (973), 710 states have internal predecessors, (973), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-13 23:24:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1371 transitions. [2022-07-13 23:24:18,306 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1371 transitions. Word has length 59 [2022-07-13 23:24:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:18,306 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1371 transitions. [2022-07-13 23:24:18,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 23:24:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1371 transitions. [2022-07-13 23:24:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 23:24:18,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:18,309 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:24:18,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 23:24:18,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash -155827494, now seen corresponding path program 1 times [2022-07-13 23:24:18,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:18,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135155638] [2022-07-13 23:24:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:18,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:18,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:18,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:18,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:24:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 23:24:18,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:18,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135155638] [2022-07-13 23:24:18,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135155638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:18,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:18,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:24:18,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986174761] [2022-07-13 23:24:18,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:18,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:24:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:18,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:24:18,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:18,390 INFO L87 Difference]: Start difference. First operand 929 states and 1371 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 23:24:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:19,536 INFO L93 Difference]: Finished difference Result 1859 states and 2750 transitions. [2022-07-13 23:24:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:24:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-07-13 23:24:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:19,544 INFO L225 Difference]: With dead ends: 1859 [2022-07-13 23:24:19,544 INFO L226 Difference]: Without dead ends: 947 [2022-07-13 23:24:19,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:24:19,552 INFO L413 NwaCegarLoop]: 1319 mSDtfsCounter, 372 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:19,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 3515 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 23:24:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-13 23:24:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-07-13 23:24:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 686 states have (on average 1.4169096209912537) internal successors, (972), 710 states have internal predecessors, (972), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-13 23:24:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1370 transitions. [2022-07-13 23:24:19,610 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1370 transitions. Word has length 59 [2022-07-13 23:24:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:19,612 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1370 transitions. [2022-07-13 23:24:19,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 23:24:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1370 transitions. [2022-07-13 23:24:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 23:24:19,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:19,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:24:19,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 23:24:19,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:19,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:19,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1779924711, now seen corresponding path program 1 times [2022-07-13 23:24:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:19,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8559129] [2022-07-13 23:24:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:19,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:19,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 23:24:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:19,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8559129] [2022-07-13 23:24:19,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8559129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:19,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:19,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:24:19,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321082268] [2022-07-13 23:24:19,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:19,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:24:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:24:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:19,744 INFO L87 Difference]: Start difference. First operand 929 states and 1370 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 23:24:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:21,152 INFO L93 Difference]: Finished difference Result 1461 states and 2231 transitions. [2022-07-13 23:24:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:24:21,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-07-13 23:24:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:21,161 INFO L225 Difference]: With dead ends: 1461 [2022-07-13 23:24:21,161 INFO L226 Difference]: Without dead ends: 1459 [2022-07-13 23:24:21,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:24:21,168 INFO L413 NwaCegarLoop]: 2130 mSDtfsCounter, 1296 mSDsluCounter, 3160 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 5290 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:21,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 5290 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 23:24:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2022-07-13 23:24:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 931. [2022-07-13 23:24:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 688 states have (on average 1.4156976744186047) internal successors, (974), 712 states have internal predecessors, (974), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-13 23:24:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1372 transitions. [2022-07-13 23:24:21,221 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1372 transitions. Word has length 62 [2022-07-13 23:24:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:21,223 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1372 transitions. [2022-07-13 23:24:21,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 23:24:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1372 transitions. [2022-07-13 23:24:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 23:24:21,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:21,227 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:24:21,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 23:24:21,227 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2124530077, now seen corresponding path program 1 times [2022-07-13 23:24:21,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:21,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181800851] [2022-07-13 23:24:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:21,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:21,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:21,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:21,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:24:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 23:24:21,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:21,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181800851] [2022-07-13 23:24:21,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181800851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:21,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:21,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:24:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947063971] [2022-07-13 23:24:21,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:21,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:24:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:21,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:24:21,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:21,359 INFO L87 Difference]: Start difference. First operand 931 states and 1372 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:24:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:22,634 INFO L93 Difference]: Finished difference Result 2375 states and 3581 transitions. [2022-07-13 23:24:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:24:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2022-07-13 23:24:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:22,642 INFO L225 Difference]: With dead ends: 2375 [2022-07-13 23:24:22,642 INFO L226 Difference]: Without dead ends: 1463 [2022-07-13 23:24:22,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:24:22,651 INFO L413 NwaCegarLoop]: 1816 mSDtfsCounter, 2025 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 3403 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:22,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 3403 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 23:24:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-07-13 23:24:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 932. [2022-07-13 23:24:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 689 states have (on average 1.4150943396226414) internal successors, (975), 713 states have internal predecessors, (975), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-13 23:24:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1373 transitions. [2022-07-13 23:24:22,690 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1373 transitions. Word has length 72 [2022-07-13 23:24:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:22,691 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1373 transitions. [2022-07-13 23:24:22,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 23:24:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1373 transitions. [2022-07-13 23:24:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 23:24:22,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:22,694 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:24:22,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 23:24:22,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash -45216834, now seen corresponding path program 1 times [2022-07-13 23:24:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:22,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061736748] [2022-07-13 23:24:22,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:22,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:22,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 23:24:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061736748] [2022-07-13 23:24:22,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061736748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:22,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:22,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:24:22,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435904742] [2022-07-13 23:24:22,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:22,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:24:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:22,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:24:22,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:24:22,819 INFO L87 Difference]: Start difference. First operand 932 states and 1373 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:24:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:24,975 INFO L93 Difference]: Finished difference Result 2242 states and 3484 transitions. [2022-07-13 23:24:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:24:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2022-07-13 23:24:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:24,986 INFO L225 Difference]: With dead ends: 2242 [2022-07-13 23:24:24,987 INFO L226 Difference]: Without dead ends: 2240 [2022-07-13 23:24:24,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:24:24,988 INFO L413 NwaCegarLoop]: 2579 mSDtfsCounter, 2635 mSDsluCounter, 5535 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 8114 SdHoareTripleChecker+Invalid, 3483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:24,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2833 Valid, 8114 Invalid, 3483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 23:24:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2022-07-13 23:24:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 934. [2022-07-13 23:24:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 690 states have (on average 1.4144927536231884) internal successors, (976), 713 states have internal predecessors, (976), 200 states have call successors, (200), 43 states have call predecessors, (200), 43 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2022-07-13 23:24:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1376 transitions. [2022-07-13 23:24:25,042 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1376 transitions. Word has length 74 [2022-07-13 23:24:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:25,042 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1376 transitions. [2022-07-13 23:24:25,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 23:24:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1376 transitions. [2022-07-13 23:24:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 23:24:25,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:25,046 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:24:25,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 23:24:25,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:25,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1411070669, now seen corresponding path program 1 times [2022-07-13 23:24:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:25,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953978605] [2022-07-13 23:24:25,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 23:24:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:24:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 23:24:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 23:24:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 23:24:25,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:25,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953978605] [2022-07-13 23:24:25,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953978605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:25,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:25,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:24:25,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682566623] [2022-07-13 23:24:25,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:25,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:24:25,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:25,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:24:25,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:24:25,193 INFO L87 Difference]: Start difference. First operand 934 states and 1376 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:24:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:25,880 INFO L93 Difference]: Finished difference Result 1896 states and 2786 transitions. [2022-07-13 23:24:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:24:25,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-07-13 23:24:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:25,885 INFO L225 Difference]: With dead ends: 1896 [2022-07-13 23:24:25,885 INFO L226 Difference]: Without dead ends: 981 [2022-07-13 23:24:25,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-13 23:24:25,888 INFO L413 NwaCegarLoop]: 1318 mSDtfsCounter, 1481 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:25,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 1915 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 23:24:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-07-13 23:24:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 954. [2022-07-13 23:24:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 704 states have (on average 1.40625) internal successors, (990), 727 states have internal predecessors, (990), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-13 23:24:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1394 transitions. [2022-07-13 23:24:25,938 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1394 transitions. Word has length 104 [2022-07-13 23:24:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:25,938 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 1394 transitions. [2022-07-13 23:24:25,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:24:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1394 transitions. [2022-07-13 23:24:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 23:24:25,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:25,942 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:24:25,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 23:24:25,942 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1281162515, now seen corresponding path program 1 times [2022-07-13 23:24:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:25,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76211599] [2022-07-13 23:24:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 23:24:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 23:24:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:24:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 23:24:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 23:24:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:26,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76211599] [2022-07-13 23:24:26,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76211599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:26,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:26,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:24:26,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858895467] [2022-07-13 23:24:26,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:26,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:24:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:26,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:24:26,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:26,106 INFO L87 Difference]: Start difference. First operand 954 states and 1394 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:24:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:27,721 INFO L93 Difference]: Finished difference Result 2412 states and 3616 transitions. [2022-07-13 23:24:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:24:27,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2022-07-13 23:24:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:27,729 INFO L225 Difference]: With dead ends: 2412 [2022-07-13 23:24:27,729 INFO L226 Difference]: Without dead ends: 1497 [2022-07-13 23:24:27,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:24:27,733 INFO L413 NwaCegarLoop]: 1875 mSDtfsCounter, 2123 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 3502 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:27,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 3502 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 23:24:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2022-07-13 23:24:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 958. [2022-07-13 23:24:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 708 states have (on average 1.405367231638418) internal successors, (995), 731 states have internal predecessors, (995), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-13 23:24:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1399 transitions. [2022-07-13 23:24:27,788 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1399 transitions. Word has length 106 [2022-07-13 23:24:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:27,789 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1399 transitions. [2022-07-13 23:24:27,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:24:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1399 transitions. [2022-07-13 23:24:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 23:24:27,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:27,792 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:24:27,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 23:24:27,792 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:27,793 INFO L85 PathProgramCache]: Analyzing trace with hash 10856094, now seen corresponding path program 1 times [2022-07-13 23:24:27,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:27,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334551731] [2022-07-13 23:24:27,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:27,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:24:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:24:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 23:24:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:24:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 23:24:27,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:27,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334551731] [2022-07-13 23:24:27,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334551731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:27,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:27,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:24:27,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051630441] [2022-07-13 23:24:27,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:27,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:24:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:24:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:24:27,915 INFO L87 Difference]: Start difference. First operand 958 states and 1399 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 23:24:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:28,777 INFO L93 Difference]: Finished difference Result 1905 states and 2803 transitions. [2022-07-13 23:24:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:24:28,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2022-07-13 23:24:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:28,781 INFO L225 Difference]: With dead ends: 1905 [2022-07-13 23:24:28,781 INFO L226 Difference]: Without dead ends: 986 [2022-07-13 23:24:28,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-13 23:24:28,784 INFO L413 NwaCegarLoop]: 1312 mSDtfsCounter, 365 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:28,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2697 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:24:28,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-07-13 23:24:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 958. [2022-07-13 23:24:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 708 states have (on average 1.4011299435028248) internal successors, (992), 731 states have internal predecessors, (992), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-13 23:24:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1396 transitions. [2022-07-13 23:24:28,826 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1396 transitions. Word has length 109 [2022-07-13 23:24:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:28,827 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1396 transitions. [2022-07-13 23:24:28,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 23:24:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1396 transitions. [2022-07-13 23:24:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 23:24:28,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:28,832 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:24:28,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 23:24:28,832 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1938120389, now seen corresponding path program 1 times [2022-07-13 23:24:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:28,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553891101] [2022-07-13 23:24:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:28,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:24:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:24:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:24:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 23:24:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 23:24:28,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553891101] [2022-07-13 23:24:28,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553891101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:28,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:28,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:24:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295639016] [2022-07-13 23:24:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:28,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:24:28,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:28,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:24:28,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:28,943 INFO L87 Difference]: Start difference. First operand 958 states and 1396 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 23:24:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:30,295 INFO L93 Difference]: Finished difference Result 1507 states and 2274 transitions. [2022-07-13 23:24:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:24:30,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2022-07-13 23:24:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:30,302 INFO L225 Difference]: With dead ends: 1507 [2022-07-13 23:24:30,302 INFO L226 Difference]: Without dead ends: 1505 [2022-07-13 23:24:30,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:24:30,304 INFO L413 NwaCegarLoop]: 2132 mSDtfsCounter, 1292 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 5298 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:30,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 5298 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 23:24:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2022-07-13 23:24:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 958. [2022-07-13 23:24:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 708 states have (on average 1.4011299435028248) internal successors, (992), 731 states have internal predecessors, (992), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-13 23:24:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1396 transitions. [2022-07-13 23:24:30,377 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1396 transitions. Word has length 112 [2022-07-13 23:24:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:30,377 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1396 transitions. [2022-07-13 23:24:30,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 23:24:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1396 transitions. [2022-07-13 23:24:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-13 23:24:30,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:30,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:24:30,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 23:24:30,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1129348236, now seen corresponding path program 1 times [2022-07-13 23:24:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:30,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349709266] [2022-07-13 23:24:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:30,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:24:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:24:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 23:24:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:24:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:24:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 23:24:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:24:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 23:24:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 23:24:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 23:24:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 23:24:30,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:30,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349709266] [2022-07-13 23:24:30,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349709266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:24:30,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840071762] [2022-07-13 23:24:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:30,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:24:30,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:24:30,567 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-13 23:24:30,569 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-13 23:24:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:30,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 23:24:30,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:24:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 23:24:31,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:24:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 23:24:31,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840071762] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:24:31,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:24:31,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-07-13 23:24:31,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068805477] [2022-07-13 23:24:31,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:24:31,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 23:24:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 23:24:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:24:31,193 INFO L87 Difference]: Start difference. First operand 958 states and 1396 transitions. Second operand has 12 states, 12 states have (on average 16.083333333333332) internal successors, (193), 10 states have internal predecessors, (193), 4 states have call successors, (46), 5 states have call predecessors, (46), 3 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2022-07-13 23:24:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:34,019 INFO L93 Difference]: Finished difference Result 3941 states and 6074 transitions. [2022-07-13 23:24:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:24:34,020 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 16.083333333333332) internal successors, (193), 10 states have internal predecessors, (193), 4 states have call successors, (46), 5 states have call predecessors, (46), 3 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 151 [2022-07-13 23:24:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:34,031 INFO L225 Difference]: With dead ends: 3941 [2022-07-13 23:24:34,032 INFO L226 Difference]: Without dead ends: 3022 [2022-07-13 23:24:34,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:24:34,035 INFO L413 NwaCegarLoop]: 1908 mSDtfsCounter, 7057 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 2971 mSolverCounterSat, 2968 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7469 SdHoareTripleChecker+Valid, 5958 SdHoareTripleChecker+Invalid, 5939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2968 IncrementalHoareTripleChecker+Valid, 2971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:34,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7469 Valid, 5958 Invalid, 5939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2968 Valid, 2971 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 23:24:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-07-13 23:24:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 965. [2022-07-13 23:24:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 715 states have (on average 1.4) internal successors, (1001), 738 states have internal predecessors, (1001), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-13 23:24:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1405 transitions. [2022-07-13 23:24:34,125 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1405 transitions. Word has length 151 [2022-07-13 23:24:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:34,125 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1405 transitions. [2022-07-13 23:24:34,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.083333333333332) internal successors, (193), 10 states have internal predecessors, (193), 4 states have call successors, (46), 5 states have call predecessors, (46), 3 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2022-07-13 23:24:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1405 transitions. [2022-07-13 23:24:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-13 23:24:34,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:34,128 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:24:34,162 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-13 23:24:34,345 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,SelfDestructingSolverStorable9 [2022-07-13 23:24:34,345 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash -418278925, now seen corresponding path program 1 times [2022-07-13 23:24:34,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:34,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117142439] [2022-07-13 23:24:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:24:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:24:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:24:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:24:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:24:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:24:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:24:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:24:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 23:24:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 23:24:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 23:24:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 23:24:34,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:34,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117142439] [2022-07-13 23:24:34,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117142439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:34,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:34,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 23:24:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116782391] [2022-07-13 23:24:34,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:34,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 23:24:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:34,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 23:24:34,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 23:24:34,550 INFO L87 Difference]: Start difference. First operand 965 states and 1405 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 8 states have internal predecessors, (102), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-13 23:24:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:39,060 INFO L93 Difference]: Finished difference Result 3113 states and 4851 transitions. [2022-07-13 23:24:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 23:24:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 8 states have internal predecessors, (102), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2022-07-13 23:24:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:39,072 INFO L225 Difference]: With dead ends: 3113 [2022-07-13 23:24:39,072 INFO L226 Difference]: Without dead ends: 3111 [2022-07-13 23:24:39,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-07-13 23:24:39,073 INFO L413 NwaCegarLoop]: 3466 mSDtfsCounter, 3720 mSDsluCounter, 17608 mSDsCounter, 0 mSdLazyCounter, 7885 mSolverCounterSat, 1902 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3802 SdHoareTripleChecker+Valid, 21074 SdHoareTripleChecker+Invalid, 9787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1902 IncrementalHoareTripleChecker+Valid, 7885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:39,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3802 Valid, 21074 Invalid, 9787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1902 Valid, 7885 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-13 23:24:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-07-13 23:24:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 967. [2022-07-13 23:24:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.399441340782123) internal successors, (1002), 739 states have internal predecessors, (1002), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-13 23:24:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1408 transitions. [2022-07-13 23:24:39,146 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1408 transitions. Word has length 160 [2022-07-13 23:24:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:39,147 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1408 transitions. [2022-07-13 23:24:39,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 8 states have internal predecessors, (102), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-13 23:24:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1408 transitions. [2022-07-13 23:24:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-13 23:24:39,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:39,150 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:24:39,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 23:24:39,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -181531566, now seen corresponding path program 1 times [2022-07-13 23:24:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:39,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438696624] [2022-07-13 23:24:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:24:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:24:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:24:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:24:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:24:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:24:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:24:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:24:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 23:24:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 23:24:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 23:24:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 23:24:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 23:24:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-13 23:24:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 23:24:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 23:24:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:39,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438696624] [2022-07-13 23:24:39,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438696624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:39,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:39,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:24:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403179559] [2022-07-13 23:24:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:39,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:24:39,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:39,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:24:39,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:39,295 INFO L87 Difference]: Start difference. First operand 967 states and 1408 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:40,089 INFO L93 Difference]: Finished difference Result 1923 states and 2815 transitions. [2022-07-13 23:24:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:24:40,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 202 [2022-07-13 23:24:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:40,094 INFO L225 Difference]: With dead ends: 1923 [2022-07-13 23:24:40,094 INFO L226 Difference]: Without dead ends: 995 [2022-07-13 23:24:40,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:24:40,096 INFO L413 NwaCegarLoop]: 1311 mSDtfsCounter, 724 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:40,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2740 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 23:24:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-13 23:24:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-13 23:24:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.3952513966480447) internal successors, (999), 739 states have internal predecessors, (999), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-13 23:24:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1405 transitions. [2022-07-13 23:24:40,173 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1405 transitions. Word has length 202 [2022-07-13 23:24:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:40,174 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1405 transitions. [2022-07-13 23:24:40,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1405 transitions. [2022-07-13 23:24:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-13 23:24:40,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:40,178 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:24:40,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 23:24:40,178 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1912426699, now seen corresponding path program 1 times [2022-07-13 23:24:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:40,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144673940] [2022-07-13 23:24:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:24:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:24:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:24:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:24:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:24:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:24:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:24:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:24:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 23:24:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 23:24:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 23:24:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 23:24:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 23:24:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 23:24:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 23:24:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:24:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 23:24:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-13 23:24:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 23:24:40,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:40,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144673940] [2022-07-13 23:24:40,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144673940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:40,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:40,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:24:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052284842] [2022-07-13 23:24:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:40,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:24:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:24:40,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:40,316 INFO L87 Difference]: Start difference. First operand 967 states and 1405 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:41,180 INFO L93 Difference]: Finished difference Result 1923 states and 2809 transitions. [2022-07-13 23:24:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:24:41,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 205 [2022-07-13 23:24:41,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:41,184 INFO L225 Difference]: With dead ends: 1923 [2022-07-13 23:24:41,184 INFO L226 Difference]: Without dead ends: 995 [2022-07-13 23:24:41,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:41,187 INFO L413 NwaCegarLoop]: 1305 mSDtfsCounter, 365 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:41,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 3286 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:24:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-13 23:24:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-13 23:24:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.3910614525139664) internal successors, (996), 739 states have internal predecessors, (996), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-13 23:24:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1402 transitions. [2022-07-13 23:24:41,248 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1402 transitions. Word has length 205 [2022-07-13 23:24:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:41,249 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1402 transitions. [2022-07-13 23:24:41,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1402 transitions. [2022-07-13 23:24:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-13 23:24:41,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:41,253 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:24:41,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 23:24:41,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:41,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2088105750, now seen corresponding path program 1 times [2022-07-13 23:24:41,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:41,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270917077] [2022-07-13 23:24:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:24:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:24:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:24:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:24:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:24:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:24:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:24:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:24:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 23:24:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 23:24:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 23:24:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 23:24:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 23:24:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 23:24:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-13 23:24:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-13 23:24:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 23:24:41,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:41,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270917077] [2022-07-13 23:24:41,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270917077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:41,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:41,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:24:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721454617] [2022-07-13 23:24:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:41,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:24:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:24:41,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:41,410 INFO L87 Difference]: Start difference. First operand 967 states and 1402 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:42,285 INFO L93 Difference]: Finished difference Result 1923 states and 2803 transitions. [2022-07-13 23:24:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:24:42,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 208 [2022-07-13 23:24:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:42,289 INFO L225 Difference]: With dead ends: 1923 [2022-07-13 23:24:42,289 INFO L226 Difference]: Without dead ends: 995 [2022-07-13 23:24:42,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:42,292 INFO L413 NwaCegarLoop]: 1305 mSDtfsCounter, 365 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:42,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 3287 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:24:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-13 23:24:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-13 23:24:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.3868715083798884) internal successors, (993), 739 states have internal predecessors, (993), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-13 23:24:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1399 transitions. [2022-07-13 23:24:42,353 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1399 transitions. Word has length 208 [2022-07-13 23:24:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:42,354 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1399 transitions. [2022-07-13 23:24:42,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1399 transitions. [2022-07-13 23:24:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-13 23:24:42,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:42,357 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:24:42,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 23:24:42,357 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:42,358 INFO L85 PathProgramCache]: Analyzing trace with hash 338207523, now seen corresponding path program 1 times [2022-07-13 23:24:42,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:42,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457499210] [2022-07-13 23:24:42,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:42,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:24:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:24:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:24:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:24:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:24:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:24:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:24:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:24:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 23:24:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 23:24:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 23:24:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 23:24:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 23:24:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:24:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:24:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-13 23:24:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-13 23:24:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 23:24:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:42,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457499210] [2022-07-13 23:24:42,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457499210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:42,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:42,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:24:42,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853692839] [2022-07-13 23:24:42,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:42,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:24:42,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:24:42,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:42,501 INFO L87 Difference]: Start difference. First operand 967 states and 1399 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:43,294 INFO L93 Difference]: Finished difference Result 1923 states and 2797 transitions. [2022-07-13 23:24:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:24:43,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 211 [2022-07-13 23:24:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:43,299 INFO L225 Difference]: With dead ends: 1923 [2022-07-13 23:24:43,299 INFO L226 Difference]: Without dead ends: 995 [2022-07-13 23:24:43,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:24:43,301 INFO L413 NwaCegarLoop]: 1302 mSDtfsCounter, 730 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:43,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2702 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 23:24:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-13 23:24:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-13 23:24:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.3826815642458101) internal successors, (990), 739 states have internal predecessors, (990), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-13 23:24:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1396 transitions. [2022-07-13 23:24:43,360 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1396 transitions. Word has length 211 [2022-07-13 23:24:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:43,361 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1396 transitions. [2022-07-13 23:24:43,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1396 transitions. [2022-07-13 23:24:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-13 23:24:43,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:24:43,365 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:24:43,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 23:24:43,365 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:24:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:24:43,365 INFO L85 PathProgramCache]: Analyzing trace with hash -978948990, now seen corresponding path program 1 times [2022-07-13 23:24:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:24:43,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125688486] [2022-07-13 23:24:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:24:43,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:24:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:24:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:24:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:24:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:24:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:24:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:24:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:24:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:24:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:24:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:24:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:24:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:24:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:24:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 23:24:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 23:24:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 23:24:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 23:24:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 23:24:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:24:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 23:24:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 23:24:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-13 23:24:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 23:24:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:24:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 23:24:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:24:43,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125688486] [2022-07-13 23:24:43,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125688486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:24:43,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:24:43,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 23:24:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165192117] [2022-07-13 23:24:43,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:24:43,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 23:24:43,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:24:43,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 23:24:43,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 23:24:43,570 INFO L87 Difference]: Start difference. First operand 967 states and 1396 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:24:48,362 INFO L93 Difference]: Finished difference Result 3553 states and 5556 transitions. [2022-07-13 23:24:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 23:24:48,363 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 214 [2022-07-13 23:24:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:24:48,363 INFO L225 Difference]: With dead ends: 3553 [2022-07-13 23:24:48,363 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 23:24:48,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-07-13 23:24:48,371 INFO L413 NwaCegarLoop]: 3666 mSDtfsCounter, 3763 mSDsluCounter, 18563 mSDsCounter, 0 mSdLazyCounter, 8720 mSolverCounterSat, 1944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3958 SdHoareTripleChecker+Valid, 22229 SdHoareTripleChecker+Invalid, 10664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1944 IncrementalHoareTripleChecker+Valid, 8720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:24:48,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3958 Valid, 22229 Invalid, 10664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1944 Valid, 8720 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 23:24:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 23:24:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 23:24:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 23:24:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 23:24:48,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2022-07-13 23:24:48,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:24:48,373 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 23:24:48,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-13 23:24:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 23:24:48,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 23:24:48,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 23:24:48,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 23:24:48,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.