./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 eb692b52 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-?-eb692b5 [2022-07-19 22:46:40,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:46:40,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:46:40,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:46:40,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:46:40,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:46:40,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:46:40,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:46:40,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:46:40,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:46:40,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:46:40,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:46:40,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:46:40,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:46:40,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:46:40,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:46:40,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:46:40,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:46:40,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:46:40,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:46:40,972 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:46:40,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:46:40,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:46:40,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:46:40,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:46:40,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:46:40,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:46:40,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:46:40,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:46:40,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:46:40,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:46:40,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:46:40,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:46:40,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:46:40,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:46:40,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:46:40,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:46:40,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:46:40,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:46:40,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:46:40,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:46:40,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:46:40,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:46:41,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:46:41,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:46:41,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:46:41,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:46:41,018 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:46:41,018 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:46:41,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:46:41,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:46:41,019 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:46:41,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:46:41,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:46:41,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:46:41,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:46:41,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:46:41,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:46:41,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:46:41,021 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:46:41,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:46:41,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:46:41,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:46:41,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:46:41,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:46:41,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:46:41,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:46:41,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:46:41,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:46:41,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:46:41,023 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:46:41,023 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:46:41,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:46:41,023 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-19 22:46:41,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:46:41,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:46:41,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:46:41,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:46:41,233 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:46:41,233 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-19 22:46:41,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ed8cd9d/50b74c62e3124b14801cc71999734576/FLAG84d3d32fc [2022-07-19 22:46:41,822 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:46:41,823 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-19 22:46:41,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ed8cd9d/50b74c62e3124b14801cc71999734576/FLAG84d3d32fc [2022-07-19 22:46:42,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ed8cd9d/50b74c62e3124b14801cc71999734576 [2022-07-19 22:46:42,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:46:42,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:46:42,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:46:42,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:46:42,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:46:42,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:46:42" (1/1) ... [2022-07-19 22:46:42,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc7c78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:42, skipping insertion in model container [2022-07-19 22:46:42,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:46:42" (1/1) ... [2022-07-19 22:46:42,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:46:42,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:46:42,814 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-19 22:46:42,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:46:42,839 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:46:43,088 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-19 22:46:43,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:46:43,148 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:46:43,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43 WrapperNode [2022-07-19 22:46:43,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:46:43,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:46:43,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:46:43,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:46:43,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,285 INFO L137 Inliner]: procedures = 157, calls = 810, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2783 [2022-07-19 22:46:43,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:46:43,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:46:43,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:46:43,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:46:43,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:46:43,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:46:43,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:46:43,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:46:43,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (1/1) ... [2022-07-19 22:46:43,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:46:43,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:46:43,482 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-19 22:46:43,488 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-19 22:46:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 22:46:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-19 22:46:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 22:46:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 22:46:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:46:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-19 22:46:43,518 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-19 22:46:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-19 22:46:43,519 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-19 22:46:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-19 22:46:43,519 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-19 22:46:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 22:46:43,519 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 22:46:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-19 22:46:43,519 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-19 22:46:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 22:46:43,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 22:46:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-19 22:46:43,520 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-19 22:46:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-07-19 22:46:43,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-07-19 22:46:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-19 22:46:43,520 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-19 22:46:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 22:46:43,521 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 22:46:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-19 22:46:43,521 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-19 22:46:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:46:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-19 22:46:43,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-19 22:46:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-19 22:46:43,522 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-19 22:46:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-19 22:46:43,522 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-19 22:46:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-19 22:46:43,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-19 22:46:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-19 22:46:43,523 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-19 22:46:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-19 22:46:43,523 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-19 22:46:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:46:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-19 22:46:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-19 22:46:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-19 22:46:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-19 22:46:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:46:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-19 22:46:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-19 22:46:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-19 22:46:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-19 22:46:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:46:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:46:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-19 22:46:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-19 22:46:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-19 22:46:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:46:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-19 22:46:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-19 22:46:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-19 22:46:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-19 22:46:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-19 22:46:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-19 22:46:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-19 22:46:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-19 22:46:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-19 22:46:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-19 22:46:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:46:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-19 22:46:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-19 22:46:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:46:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-19 22:46:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-19 22:46:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-19 22:46:43,530 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-19 22:46:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-19 22:46:43,530 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-19 22:46:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-19 22:46:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-19 22:46:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-19 22:46:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-19 22:46:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-19 22:46:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-19 22:46:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-19 22:46:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-19 22:46:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-19 22:46:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-19 22:46:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-19 22:46:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-19 22:46:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:46:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-19 22:46:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-19 22:46:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-07-19 22:46:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-07-19 22:46:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-19 22:46:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-19 22:46:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-19 22:46:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-19 22:46:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 22:46:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:46:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:46:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-19 22:46:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-19 22:46:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-19 22:46:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-19 22:46:44,001 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:46:44,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:46:45,498 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:46:45,508 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:46:45,508 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 22:46:45,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:46:45 BoogieIcfgContainer [2022-07-19 22:46:45,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:46:45,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:46:45,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:46:45,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:46:45,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:46:42" (1/3) ... [2022-07-19 22:46:45,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28260528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:46:45, skipping insertion in model container [2022-07-19 22:46:45,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:46:43" (2/3) ... [2022-07-19 22:46:45,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28260528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:46:45, skipping insertion in model container [2022-07-19 22:46:45,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:46:45" (3/3) ... [2022-07-19 22:46:45,515 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-07-19 22:46:45,524 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:46:45,525 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:46:45,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:46:45,578 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@5cefe3ee, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d9f174f [2022-07-19 22:46:45,578 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:46:45,583 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-19 22:46:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 22:46:45,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:46:45,594 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-19 22:46:45,594 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:46:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:46:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash -579474216, now seen corresponding path program 1 times [2022-07-19 22:46:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:46:45,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243644301] [2022-07-19 22:46:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:46:45,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:46:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:45,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:46:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:46:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:46:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:45,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:46:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:45,907 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-19 22:46:45,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:46:45,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243644301] [2022-07-19 22:46:45,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243644301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:46:45,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:46:45,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:46:45,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866558617] [2022-07-19 22:46:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:46:45,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:46:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:46:45,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:46:45,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:46:45,953 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-19 22:46:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:46:46,822 INFO L93 Difference]: Finished difference Result 1950 states and 2923 transitions. [2022-07-19 22:46:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:46:46,825 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-19 22:46:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:46:46,838 INFO L225 Difference]: With dead ends: 1950 [2022-07-19 22:46:46,839 INFO L226 Difference]: Without dead ends: 947 [2022-07-19 22:46:46,846 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-19 22:46:46,849 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 1573 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 1982 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-19 22:46:46,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 1982 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 22:46:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-19 22:46:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-07-19 22:46:46,920 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-19 22:46:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1371 transitions. [2022-07-19 22:46:46,926 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1371 transitions. Word has length 59 [2022-07-19 22:46:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:46:46,927 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1371 transitions. [2022-07-19 22:46:46,927 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-19 22:46:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1371 transitions. [2022-07-19 22:46:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 22:46:46,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:46:46,932 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-19 22:46:46,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:46:46,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:46:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:46:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash -155827494, now seen corresponding path program 1 times [2022-07-19 22:46:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:46:46,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876969703] [2022-07-19 22:46:46,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:46:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:46:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:46,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:46:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:46:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:47,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:46:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:47,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:46:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:47,023 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-19 22:46:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:46:47,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876969703] [2022-07-19 22:46:47,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876969703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:46:47,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:46:47,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:46:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940736512] [2022-07-19 22:46:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:46:47,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:46:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:46:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:46:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:46:47,027 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-19 22:46:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:46:48,358 INFO L93 Difference]: Finished difference Result 1859 states and 2750 transitions. [2022-07-19 22:46:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:46:48,359 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-19 22:46:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:46:48,366 INFO L225 Difference]: With dead ends: 1859 [2022-07-19 22:46:48,367 INFO L226 Difference]: Without dead ends: 947 [2022-07-19 22:46:48,372 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-19 22:46:48,375 INFO L413 NwaCegarLoop]: 1329 mSDtfsCounter, 372 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 3546 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:46:48,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 3546 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 22:46:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-19 22:46:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-07-19 22:46:48,427 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-19 22:46:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1370 transitions. [2022-07-19 22:46:48,433 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1370 transitions. Word has length 59 [2022-07-19 22:46:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:46:48,434 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1370 transitions. [2022-07-19 22:46:48,434 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-19 22:46:48,435 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1370 transitions. [2022-07-19 22:46:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 22:46:48,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:46:48,438 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-19 22:46:48,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:46:48,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:46:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:46:48,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1779924711, now seen corresponding path program 1 times [2022-07-19 22:46:48,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:46:48,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44069346] [2022-07-19 22:46:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:46:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:46:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:48,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:46:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:48,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:46:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:48,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:46:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:48,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:46:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:48,587 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-19 22:46:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:46:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44069346] [2022-07-19 22:46:48,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44069346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:46:48,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:46:48,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:46:48,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749295939] [2022-07-19 22:46:48,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:46:48,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:46:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:46:48,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:46:48,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:46:48,590 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-19 22:46:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:46:50,224 INFO L93 Difference]: Finished difference Result 1461 states and 2231 transitions. [2022-07-19 22:46:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:46:50,225 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-19 22:46:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:46:50,232 INFO L225 Difference]: With dead ends: 1461 [2022-07-19 22:46:50,233 INFO L226 Difference]: Without dead ends: 1459 [2022-07-19 22:46:50,234 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-19 22:46:50,234 INFO L413 NwaCegarLoop]: 2134 mSDtfsCounter, 1296 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 5300 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:46:50,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 5300 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 22:46:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2022-07-19 22:46:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 931. [2022-07-19 22:46:50,291 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-19 22:46:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1372 transitions. [2022-07-19 22:46:50,295 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1372 transitions. Word has length 62 [2022-07-19 22:46:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:46:50,296 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1372 transitions. [2022-07-19 22:46:50,296 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-19 22:46:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1372 transitions. [2022-07-19 22:46:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 22:46:50,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:46:50,298 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-19 22:46:50,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:46:50,298 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:46:50,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:46:50,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2124530077, now seen corresponding path program 1 times [2022-07-19 22:46:50,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:46:50,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379210128] [2022-07-19 22:46:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:46:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:46:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:50,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:46:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:50,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:46:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:50,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:46:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:50,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:46:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:50,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:46:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:50,419 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-19 22:46:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:46:50,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379210128] [2022-07-19 22:46:50,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379210128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:46:50,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:46:50,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:46:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959074877] [2022-07-19 22:46:50,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:46:50,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:46:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:46:50,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:46:50,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:46:50,421 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-19 22:46:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:46:51,997 INFO L93 Difference]: Finished difference Result 2375 states and 3581 transitions. [2022-07-19 22:46:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:46:51,998 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-19 22:46:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:46:52,005 INFO L225 Difference]: With dead ends: 2375 [2022-07-19 22:46:52,005 INFO L226 Difference]: Without dead ends: 1463 [2022-07-19 22:46:52,008 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-19 22:46:52,009 INFO L413 NwaCegarLoop]: 1814 mSDtfsCounter, 2025 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2300 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:46:52,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2300 Valid, 3399 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 22:46:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-07-19 22:46:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 932. [2022-07-19 22:46:52,051 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-19 22:46:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1373 transitions. [2022-07-19 22:46:52,055 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1373 transitions. Word has length 72 [2022-07-19 22:46:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:46:52,056 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1373 transitions. [2022-07-19 22:46:52,056 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-19 22:46:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1373 transitions. [2022-07-19 22:46:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 22:46:52,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:46:52,058 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-19 22:46:52,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:46:52,059 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:46:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:46:52,059 INFO L85 PathProgramCache]: Analyzing trace with hash -45216834, now seen corresponding path program 1 times [2022-07-19 22:46:52,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:46:52,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067570179] [2022-07-19 22:46:52,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:46:52,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:46:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:46:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:52,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:46:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:46:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:52,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:52,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:46:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:52,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:46:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:52,168 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-19 22:46:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:46:52,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067570179] [2022-07-19 22:46:52,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067570179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:46:52,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:46:52,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:46:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377150371] [2022-07-19 22:46:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:46:52,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:46:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:46:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:46:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:46:52,170 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-19 22:46:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:46:54,851 INFO L93 Difference]: Finished difference Result 2242 states and 3484 transitions. [2022-07-19 22:46:54,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:46:54,852 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-19 22:46:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:46:54,863 INFO L225 Difference]: With dead ends: 2242 [2022-07-19 22:46:54,863 INFO L226 Difference]: Without dead ends: 2240 [2022-07-19 22:46:54,866 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-19 22:46:54,867 INFO L413 NwaCegarLoop]: 2587 mSDtfsCounter, 2635 mSDsluCounter, 5559 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 8146 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.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:46:54,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2833 Valid, 8146 Invalid, 3483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 22:46:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2022-07-19 22:46:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 934. [2022-07-19 22:46:54,961 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-19 22:46:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1376 transitions. [2022-07-19 22:46:54,978 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1376 transitions. Word has length 74 [2022-07-19 22:46:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:46:54,979 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1376 transitions. [2022-07-19 22:46:54,980 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-19 22:46:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1376 transitions. [2022-07-19 22:46:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-19 22:46:54,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:46:54,985 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-19 22:46:54,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:46:54,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:46:54,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:46:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1411070669, now seen corresponding path program 1 times [2022-07-19 22:46:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:46:54,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602492047] [2022-07-19 22:46:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:46:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:46:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:46:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:46:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:46:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:46:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:46:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:46:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:46:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:46:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 22:46:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:55,206 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-19 22:46:55,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:46:55,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602492047] [2022-07-19 22:46:55,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602492047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:46:55,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:46:55,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:46:55,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273493090] [2022-07-19 22:46:55,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:46:55,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:46:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:46:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:46:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:46:55,209 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-19 22:46:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:46:56,013 INFO L93 Difference]: Finished difference Result 1896 states and 2786 transitions. [2022-07-19 22:46:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:46:56,014 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-19 22:46:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:46:56,019 INFO L225 Difference]: With dead ends: 1896 [2022-07-19 22:46:56,019 INFO L226 Difference]: Without dead ends: 981 [2022-07-19 22:46:56,023 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-19 22:46:56,023 INFO L413 NwaCegarLoop]: 1318 mSDtfsCounter, 1481 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:46:56,024 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.7s Time] [2022-07-19 22:46:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-07-19 22:46:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 954. [2022-07-19 22:46:56,074 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-19 22:46:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1394 transitions. [2022-07-19 22:46:56,078 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1394 transitions. Word has length 104 [2022-07-19 22:46:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:46:56,079 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 1394 transitions. [2022-07-19 22:46:56,080 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-19 22:46:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1394 transitions. [2022-07-19 22:46:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 22:46:56,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:46:56,087 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-19 22:46:56,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:46:56,088 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:46:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:46:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1281162515, now seen corresponding path program 1 times [2022-07-19 22:46:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:46:56,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649023789] [2022-07-19 22:46:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:46:56,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:46:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:46:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:46:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:46:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:46:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:46:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:46:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:46:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:46:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:46:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:56,266 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-19 22:46:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:46:56,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649023789] [2022-07-19 22:46:56,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649023789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:46:56,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:46:56,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:46:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992406048] [2022-07-19 22:46:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:46:56,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:46:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:46:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:46:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:46:56,271 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-19 22:46:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:46:57,973 INFO L93 Difference]: Finished difference Result 2412 states and 3616 transitions. [2022-07-19 22:46:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:46:57,973 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-19 22:46:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:46:57,983 INFO L225 Difference]: With dead ends: 2412 [2022-07-19 22:46:57,984 INFO L226 Difference]: Without dead ends: 1497 [2022-07-19 22:46:57,988 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-19 22:46:57,989 INFO L413 NwaCegarLoop]: 1875 mSDtfsCounter, 2123 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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-19 22:46:57,990 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-19 22:46:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2022-07-19 22:46:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 958. [2022-07-19 22:46:58,047 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-19 22:46:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1399 transitions. [2022-07-19 22:46:58,050 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1399 transitions. Word has length 106 [2022-07-19 22:46:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:46:58,051 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1399 transitions. [2022-07-19 22:46:58,052 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-19 22:46:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1399 transitions. [2022-07-19 22:46:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 22:46:58,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:46:58,055 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-19 22:46:58,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:46:58,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:46:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:46:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash 10856094, now seen corresponding path program 1 times [2022-07-19 22:46:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:46:58,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351052219] [2022-07-19 22:46:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:46:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:46:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:46:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:46:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:46:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:46:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:46:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:46:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:46:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:46:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:46:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:58,207 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-19 22:46:58,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:46:58,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351052219] [2022-07-19 22:46:58,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351052219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:46:58,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:46:58,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:46:58,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008750879] [2022-07-19 22:46:58,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:46:58,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:46:58,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:46:58,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:46:58,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:46:58,210 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-19 22:46:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:46:59,143 INFO L93 Difference]: Finished difference Result 1905 states and 2803 transitions. [2022-07-19 22:46:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:46:59,143 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-19 22:46:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:46:59,148 INFO L225 Difference]: With dead ends: 1905 [2022-07-19 22:46:59,148 INFO L226 Difference]: Without dead ends: 986 [2022-07-19 22:46:59,151 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-19 22:46:59,151 INFO L413 NwaCegarLoop]: 1314 mSDtfsCounter, 365 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 2703 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-19 22:46:59,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2703 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 22:46:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-07-19 22:46:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 958. [2022-07-19 22:46:59,199 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-19 22:46:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1396 transitions. [2022-07-19 22:46:59,202 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1396 transitions. Word has length 109 [2022-07-19 22:46:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:46:59,204 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1396 transitions. [2022-07-19 22:46:59,204 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-19 22:46:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1396 transitions. [2022-07-19 22:46:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 22:46:59,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:46:59,208 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-19 22:46:59,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:46:59,208 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:46:59,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:46:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1938120389, now seen corresponding path program 1 times [2022-07-19 22:46:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:46:59,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514600000] [2022-07-19 22:46:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:46:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:46:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:46:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:46:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:46:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:46:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:46:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:46:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:46:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:46:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:46:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:46:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:46:59,335 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-19 22:46:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:46:59,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514600000] [2022-07-19 22:46:59,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514600000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:46:59,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:46:59,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:46:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278233112] [2022-07-19 22:46:59,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:46:59,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:46:59,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:46:59,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:46:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:46:59,338 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-19 22:47:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:47:00,640 INFO L93 Difference]: Finished difference Result 1507 states and 2274 transitions. [2022-07-19 22:47:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:47:00,640 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-19 22:47:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:47:00,649 INFO L225 Difference]: With dead ends: 1507 [2022-07-19 22:47:00,649 INFO L226 Difference]: Without dead ends: 1505 [2022-07-19 22:47:00,650 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-19 22:47:00,652 INFO L413 NwaCegarLoop]: 2135 mSDtfsCounter, 1292 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 5305 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:47:00,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 5305 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 22:47:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2022-07-19 22:47:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 958. [2022-07-19 22:47:00,708 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-19 22:47:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1396 transitions. [2022-07-19 22:47:00,710 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1396 transitions. Word has length 112 [2022-07-19 22:47:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:47:00,711 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1396 transitions. [2022-07-19 22:47:00,711 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-19 22:47:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1396 transitions. [2022-07-19 22:47:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-19 22:47:00,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:47:00,715 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-19 22:47:00,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:47:00,715 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:47:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:47:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1129348236, now seen corresponding path program 1 times [2022-07-19 22:47:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:47:00,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794041665] [2022-07-19 22:47:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:47:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:47:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:47:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:47:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:47:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:47:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:47:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:47:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 22:47:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:47:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:47:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:47:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:47:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 22:47:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:47:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 22:47:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:00,914 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-19 22:47:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:47:00,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794041665] [2022-07-19 22:47:00,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794041665] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:47:00,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559595622] [2022-07-19 22:47:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:47:00,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:47:00,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:47:00,937 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-19 22:47:00,946 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-19 22:47:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:01,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 22:47:01,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:47:01,463 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-19 22:47:01,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:47:01,622 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-19 22:47:01,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559595622] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:47:01,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:47:01,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-07-19 22:47:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560116976] [2022-07-19 22:47:01,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:47:01,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 22:47:01,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:47:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 22:47:01,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:47:01,624 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-19 22:47:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:47:04,193 INFO L93 Difference]: Finished difference Result 3941 states and 6074 transitions. [2022-07-19 22:47:04,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:47:04,196 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-19 22:47:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:47:04,209 INFO L225 Difference]: With dead ends: 3941 [2022-07-19 22:47:04,209 INFO L226 Difference]: Without dead ends: 3022 [2022-07-19 22:47:04,213 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-19 22:47:04,214 INFO L413 NwaCegarLoop]: 1908 mSDtfsCounter, 7057 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 2989 mSolverCounterSat, 2958 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7469 SdHoareTripleChecker+Valid, 5958 SdHoareTripleChecker+Invalid, 5947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2958 IncrementalHoareTripleChecker+Valid, 2989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:47:04,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7469 Valid, 5958 Invalid, 5947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2958 Valid, 2989 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 22:47:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-07-19 22:47:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 965. [2022-07-19 22:47:04,287 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-19 22:47:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1405 transitions. [2022-07-19 22:47:04,290 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1405 transitions. Word has length 151 [2022-07-19 22:47:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:47:04,290 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1405 transitions. [2022-07-19 22:47:04,291 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-19 22:47:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1405 transitions. [2022-07-19 22:47:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-19 22:47:04,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:47:04,294 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-19 22:47:04,316 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-19 22:47:04,515 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-19 22:47:04,516 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:47:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:47:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash -418278925, now seen corresponding path program 1 times [2022-07-19 22:47:04,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:47:04,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812631658] [2022-07-19 22:47:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:47:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:47:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:47:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:47:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:47:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:47:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:47:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:47:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:47:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:47:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:47:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:47:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:47:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:47:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:47:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-19 22:47:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:47:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:04,776 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-19 22:47:04,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:47:04,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812631658] [2022-07-19 22:47:04,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812631658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:47:04,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:47:04,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:47:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299956412] [2022-07-19 22:47:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:47:04,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:47:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:47:04,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:47:04,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:47:04,778 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-19 22:47:09,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:47:09,860 INFO L93 Difference]: Finished difference Result 3113 states and 4851 transitions. [2022-07-19 22:47:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 22:47:09,860 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-19 22:47:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:47:09,874 INFO L225 Difference]: With dead ends: 3113 [2022-07-19 22:47:09,874 INFO L226 Difference]: Without dead ends: 3111 [2022-07-19 22:47:09,875 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-19 22:47:09,875 INFO L413 NwaCegarLoop]: 3465 mSDtfsCounter, 3720 mSDsluCounter, 17601 mSDsCounter, 0 mSdLazyCounter, 7885 mSolverCounterSat, 1904 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3802 SdHoareTripleChecker+Valid, 21066 SdHoareTripleChecker+Invalid, 9789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1904 IncrementalHoareTripleChecker+Valid, 7885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:47:09,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3802 Valid, 21066 Invalid, 9789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1904 Valid, 7885 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-19 22:47:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-07-19 22:47:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 967. [2022-07-19 22:47:09,974 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-19 22:47:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1408 transitions. [2022-07-19 22:47:09,977 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1408 transitions. Word has length 160 [2022-07-19 22:47:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:47:09,977 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1408 transitions. [2022-07-19 22:47:09,977 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-19 22:47:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1408 transitions. [2022-07-19 22:47:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-19 22:47:09,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:47:09,982 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-19 22:47:09,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 22:47:09,982 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:47:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:47:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -181531566, now seen corresponding path program 1 times [2022-07-19 22:47:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:47:09,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817957187] [2022-07-19 22:47:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:47:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:47:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:47:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:47:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:47:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:47:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:47:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:47:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:47:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:47:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:47:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:47:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:47:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:47:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:47:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:47:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:47:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:47:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:47:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 22:47:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:47:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 22:47:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-19 22:47:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:10,175 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-19 22:47:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:47:10,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817957187] [2022-07-19 22:47:10,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817957187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:47:10,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:47:10,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:47:10,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259586167] [2022-07-19 22:47:10,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:47:10,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:47:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:47:10,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:47:10,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:47:10,177 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-19 22:47:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:47:11,102 INFO L93 Difference]: Finished difference Result 1923 states and 2815 transitions. [2022-07-19 22:47:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:47:11,103 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-19 22:47:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:47:11,116 INFO L225 Difference]: With dead ends: 1923 [2022-07-19 22:47:11,116 INFO L226 Difference]: Without dead ends: 995 [2022-07-19 22:47:11,120 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-19 22:47:11,120 INFO L413 NwaCegarLoop]: 1309 mSDtfsCounter, 724 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2734 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.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:47:11,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2734 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 22:47:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-19 22:47:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-19 22:47:11,222 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-19 22:47:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1405 transitions. [2022-07-19 22:47:11,224 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1405 transitions. Word has length 202 [2022-07-19 22:47:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:47:11,225 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1405 transitions. [2022-07-19 22:47:11,225 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-19 22:47:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1405 transitions. [2022-07-19 22:47:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-19 22:47:11,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:47:11,229 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-19 22:47:11,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 22:47:11,230 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:47:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:47:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1912426699, now seen corresponding path program 1 times [2022-07-19 22:47:11,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:47:11,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272655463] [2022-07-19 22:47:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:47:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:47:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:47:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:47:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:47:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:47:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:47:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:47:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:47:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:47:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:47:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:47:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:47:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:47:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:47:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:47:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:47:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:47:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 22:47:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:47:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:47:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:47:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 22:47:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-19 22:47:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:11,394 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-19 22:47:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:47:11,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272655463] [2022-07-19 22:47:11,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272655463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:47:11,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:47:11,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:47:11,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964439480] [2022-07-19 22:47:11,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:47:11,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:47:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:47:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:47:11,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:47:11,397 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-19 22:47:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:47:12,231 INFO L93 Difference]: Finished difference Result 1923 states and 2809 transitions. [2022-07-19 22:47:12,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:47:12,232 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-19 22:47:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:47:12,236 INFO L225 Difference]: With dead ends: 1923 [2022-07-19 22:47:12,236 INFO L226 Difference]: Without dead ends: 995 [2022-07-19 22:47:12,239 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-19 22:47:12,239 INFO L413 NwaCegarLoop]: 1307 mSDtfsCounter, 365 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 3294 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.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:47:12,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 3294 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 22:47:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-19 22:47:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-19 22:47:12,319 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-19 22:47:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1402 transitions. [2022-07-19 22:47:12,321 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1402 transitions. Word has length 205 [2022-07-19 22:47:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:47:12,322 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1402 transitions. [2022-07-19 22:47:12,322 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-19 22:47:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1402 transitions. [2022-07-19 22:47:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-19 22:47:12,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:47:12,326 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-19 22:47:12,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 22:47:12,326 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:47:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:47:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2088105750, now seen corresponding path program 1 times [2022-07-19 22:47:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:47:12,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710727839] [2022-07-19 22:47:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:47:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:47:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:47:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:47:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:47:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:47:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:47:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:47:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:47:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:47:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:47:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:47:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:47:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:47:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:47:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:47:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:47:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:47:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 22:47:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:47:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 22:47:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-19 22:47:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-19 22:47:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:12,485 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-19 22:47:12,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:47:12,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710727839] [2022-07-19 22:47:12,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710727839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:47:12,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:47:12,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:47:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726868783] [2022-07-19 22:47:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:47:12,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:47:12,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:47:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:47:12,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:47:12,488 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-19 22:47:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:47:13,417 INFO L93 Difference]: Finished difference Result 1923 states and 2803 transitions. [2022-07-19 22:47:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:47:13,417 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-19 22:47:13,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:47:13,423 INFO L225 Difference]: With dead ends: 1923 [2022-07-19 22:47:13,423 INFO L226 Difference]: Without dead ends: 995 [2022-07-19 22:47:13,425 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-19 22:47:13,426 INFO L413 NwaCegarLoop]: 1305 mSDtfsCounter, 365 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-19 22:47:13,426 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-19 22:47:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-19 22:47:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-19 22:47:13,490 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-19 22:47:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1399 transitions. [2022-07-19 22:47:13,492 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1399 transitions. Word has length 208 [2022-07-19 22:47:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:47:13,496 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1399 transitions. [2022-07-19 22:47:13,496 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-19 22:47:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1399 transitions. [2022-07-19 22:47:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-19 22:47:13,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:47:13,500 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-19 22:47:13,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 22:47:13,501 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:47:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:47:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash 338207523, now seen corresponding path program 1 times [2022-07-19 22:47:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:47:13,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215662325] [2022-07-19 22:47:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:47:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:47:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:47:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:47:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:47:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:47:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:47:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:47:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:47:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:47:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:47:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:47:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:47:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:47:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:47:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:47:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:47:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:47:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 22:47:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:47:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:47:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-19 22:47:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-19 22:47:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:13,685 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-19 22:47:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:47:13,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215662325] [2022-07-19 22:47:13,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215662325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:47:13,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:47:13,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:47:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538214676] [2022-07-19 22:47:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:47:13,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:47:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:47:13,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:47:13,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:47:13,689 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-19 22:47:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:47:14,613 INFO L93 Difference]: Finished difference Result 1923 states and 2797 transitions. [2022-07-19 22:47:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:47:14,613 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-19 22:47:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:47:14,620 INFO L225 Difference]: With dead ends: 1923 [2022-07-19 22:47:14,620 INFO L226 Difference]: Without dead ends: 995 [2022-07-19 22:47:14,622 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-19 22:47:14,623 INFO L413 NwaCegarLoop]: 1302 mSDtfsCounter, 730 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:47:14,623 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.8s Time] [2022-07-19 22:47:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-19 22:47:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-19 22:47:14,685 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-19 22:47:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1396 transitions. [2022-07-19 22:47:14,687 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1396 transitions. Word has length 211 [2022-07-19 22:47:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:47:14,688 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1396 transitions. [2022-07-19 22:47:14,688 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-19 22:47:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1396 transitions. [2022-07-19 22:47:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-19 22:47:14,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:47:14,692 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-19 22:47:14,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 22:47:14,692 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:47:14,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:47:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash -978948990, now seen corresponding path program 1 times [2022-07-19 22:47:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:47:14,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481745260] [2022-07-19 22:47:14,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:47:14,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:47:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:47:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:47:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 22:47:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:47:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:47:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:47:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:47:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:47:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:47:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:47:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:47:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:47:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:47:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:47:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:47:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:47:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:47:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 22:47:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 22:47:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:47:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 22:47:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-19 22:47:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-19 22:47:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:47:14,915 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-19 22:47:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:47:14,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481745260] [2022-07-19 22:47:14,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481745260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:47:14,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:47:14,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:47:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889080071] [2022-07-19 22:47:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:47:14,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:47:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:47:14,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:47:14,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:47:14,918 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-19 22:47:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:47:20,084 INFO L93 Difference]: Finished difference Result 3553 states and 5556 transitions. [2022-07-19 22:47:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 22:47:20,085 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-19 22:47:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:47:20,085 INFO L225 Difference]: With dead ends: 3553 [2022-07-19 22:47:20,085 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 22:47:20,094 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-19 22:47:20,094 INFO L413 NwaCegarLoop]: 3671 mSDtfsCounter, 3763 mSDsluCounter, 18597 mSDsCounter, 0 mSdLazyCounter, 8720 mSolverCounterSat, 1935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3956 SdHoareTripleChecker+Valid, 22268 SdHoareTripleChecker+Invalid, 10655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1935 IncrementalHoareTripleChecker+Valid, 8720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:47:20,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3956 Valid, 22268 Invalid, 10655 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1935 Valid, 8720 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-19 22:47:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 22:47:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 22:47:20,095 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-19 22:47:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 22:47:20,096 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2022-07-19 22:47:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:47:20,096 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 22:47:20,096 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-19 22:47:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 22:47:20,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 22:47:20,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:47:20,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 22:47:20,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.