./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 35987657 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-?-3598765 [2022-07-21 10:18:08,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 10:18:08,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 10:18:08,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 10:18:08,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 10:18:08,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 10:18:08,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 10:18:08,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 10:18:08,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 10:18:08,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 10:18:08,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 10:18:08,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 10:18:08,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 10:18:08,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 10:18:08,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 10:18:08,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 10:18:08,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 10:18:08,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 10:18:08,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 10:18:08,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 10:18:08,617 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 10:18:08,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 10:18:08,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 10:18:08,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 10:18:08,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 10:18:08,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 10:18:08,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 10:18:08,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 10:18:08,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 10:18:08,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 10:18:08,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 10:18:08,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 10:18:08,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 10:18:08,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 10:18:08,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 10:18:08,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 10:18:08,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 10:18:08,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 10:18:08,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 10:18:08,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 10:18:08,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 10:18:08,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 10:18:08,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 10:18:08,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 10:18:08,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 10:18:08,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 10:18:08,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 10:18:08,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 10:18:08,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 10:18:08,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 10:18:08,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 10:18:08,688 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 10:18:08,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 10:18:08,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 10:18:08,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 10:18:08,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 10:18:08,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 10:18:08,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 10:18:08,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 10:18:08,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 10:18:08,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 10:18:08,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 10:18:08,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 10:18:08,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 10:18:08,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:18:08,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 10:18:08,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 10:18:08,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 10:18:08,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 10:18:08,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 10:18:08,692 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 10:18:08,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 10:18:08,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 10:18:08,693 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-21 10:18:08,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 10:18:08,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 10:18:09,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 10:18:09,002 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 10:18:09,004 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 10:18:09,005 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-21 10:18:09,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74fe7f28b/269954d998e0406b8e7fc7ad0f20ad13/FLAG04a9e10f7 [2022-07-21 10:18:09,758 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 10:18:09,758 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-21 10:18:09,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74fe7f28b/269954d998e0406b8e7fc7ad0f20ad13/FLAG04a9e10f7 [2022-07-21 10:18:09,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74fe7f28b/269954d998e0406b8e7fc7ad0f20ad13 [2022-07-21 10:18:09,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 10:18:09,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 10:18:09,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 10:18:09,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 10:18:09,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 10:18:09,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:18:09" (1/1) ... [2022-07-21 10:18:09,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca9cb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:09, skipping insertion in model container [2022-07-21 10:18:09,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:18:09" (1/1) ... [2022-07-21 10:18:09,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 10:18:09,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 10:18:11,039 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-21 10:18:11,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:18:11,104 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 10:18:11,347 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-21 10:18:11,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:18:11,450 INFO L208 MainTranslator]: Completed translation [2022-07-21 10:18:11,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11 WrapperNode [2022-07-21 10:18:11,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 10:18:11,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 10:18:11,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 10:18:11,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 10:18:11,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,633 INFO L137 Inliner]: procedures = 157, calls = 810, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2783 [2022-07-21 10:18:11,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 10:18:11,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 10:18:11,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 10:18:11,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 10:18:11,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 10:18:11,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 10:18:11,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 10:18:11,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 10:18:11,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (1/1) ... [2022-07-21 10:18:11,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:18:11,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:18:11,877 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-21 10:18:11,902 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-21 10:18:11,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 10:18:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-21 10:18:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 10:18:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 10:18:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 10:18:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 10:18:11,933 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 10:18:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-21 10:18:11,934 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-21 10:18:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-21 10:18:11,934 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-21 10:18:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 10:18:11,934 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 10:18:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-21 10:18:11,934 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-21 10:18:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 10:18:11,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 10:18:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-21 10:18:11,935 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-21 10:18:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-07-21 10:18:11,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-07-21 10:18:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-21 10:18:11,936 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-21 10:18:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 10:18:11,936 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 10:18:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-21 10:18:11,936 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-21 10:18:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 10:18:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-21 10:18:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-21 10:18:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-21 10:18:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-21 10:18:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 10:18:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 10:18:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 10:18:11,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 10:18:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 10:18:11,938 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 10:18:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-21 10:18:11,938 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-21 10:18:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 10:18:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-21 10:18:11,939 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-21 10:18:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-21 10:18:11,939 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-21 10:18:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 10:18:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-21 10:18:11,940 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-21 10:18:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-21 10:18:11,940 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-21 10:18:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 10:18:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 10:18:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 10:18:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-21 10:18:11,941 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-21 10:18:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 10:18:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-21 10:18:11,942 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-21 10:18:11,943 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 10:18:11,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 10:18:11,943 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-21 10:18:11,944 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-21 10:18:11,944 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-21 10:18:11,944 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-21 10:18:11,944 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-21 10:18:11,944 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-21 10:18:11,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 10:18:11,944 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-21 10:18:11,945 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-21 10:18:11,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 10:18:11,945 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-21 10:18:11,945 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-21 10:18:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-21 10:18:11,946 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-21 10:18:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 10:18:11,946 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 10:18:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 10:18:11,946 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 10:18:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-21 10:18:11,947 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-21 10:18:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 10:18:11,947 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 10:18:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 10:18:11,947 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 10:18:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-21 10:18:11,947 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-21 10:18:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-21 10:18:11,948 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-21 10:18:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 10:18:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-21 10:18:11,948 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-21 10:18:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-07-21 10:18:11,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-07-21 10:18:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-21 10:18:11,949 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-21 10:18:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-21 10:18:11,950 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-21 10:18:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 10:18:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 10:18:11,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 10:18:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-21 10:18:11,951 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-21 10:18:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-21 10:18:11,951 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-21 10:18:12,454 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 10:18:12,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 10:18:14,363 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 10:18:14,379 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 10:18:14,379 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 10:18:14,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:18:14 BoogieIcfgContainer [2022-07-21 10:18:14,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 10:18:14,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 10:18:14,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 10:18:14,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 10:18:14,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:18:09" (1/3) ... [2022-07-21 10:18:14,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568229dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:18:14, skipping insertion in model container [2022-07-21 10:18:14,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:18:11" (2/3) ... [2022-07-21 10:18:14,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568229dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:18:14, skipping insertion in model container [2022-07-21 10:18:14,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:18:14" (3/3) ... [2022-07-21 10:18:14,389 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-07-21 10:18:14,401 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 10:18:14,402 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 10:18:14,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 10:18:14,489 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@7fe02bcb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a9ea1c0 [2022-07-21 10:18:14,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 10:18:14,496 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-21 10:18:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 10:18:14,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:14,510 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-21 10:18:14,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash -579474216, now seen corresponding path program 1 times [2022-07-21 10:18:14,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:14,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579626086] [2022-07-21 10:18:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:14,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:14,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:14,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:14,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:18:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:14,996 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-21 10:18:15,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:15,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579626086] [2022-07-21 10:18:15,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579626086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:15,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:15,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:18:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820659333] [2022-07-21 10:18:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:15,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:18:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:15,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:18:15,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:18:15,044 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-21 10:18:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:16,063 INFO L93 Difference]: Finished difference Result 1950 states and 2923 transitions. [2022-07-21 10:18:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:18:16,066 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-21 10:18:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:16,090 INFO L225 Difference]: With dead ends: 1950 [2022-07-21 10:18:16,090 INFO L226 Difference]: Without dead ends: 947 [2022-07-21 10:18:16,100 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-21 10:18:16,104 INFO L413 NwaCegarLoop]: 1368 mSDtfsCounter, 1580 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:16,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 1976 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 10:18:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-21 10:18:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-07-21 10:18:16,238 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-21 10:18:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1371 transitions. [2022-07-21 10:18:16,247 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1371 transitions. Word has length 59 [2022-07-21 10:18:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:16,247 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1371 transitions. [2022-07-21 10:18:16,248 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-21 10:18:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1371 transitions. [2022-07-21 10:18:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 10:18:16,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:16,252 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-21 10:18:16,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 10:18:16,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:16,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -155827494, now seen corresponding path program 1 times [2022-07-21 10:18:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:16,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903310304] [2022-07-21 10:18:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:16,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:16,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:16,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:16,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:18:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:16,395 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-21 10:18:16,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:16,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903310304] [2022-07-21 10:18:16,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903310304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:16,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:16,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:18:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963484571] [2022-07-21 10:18:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:16,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:18:16,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:16,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:18:16,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:18:16,399 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-21 10:18:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:17,713 INFO L93 Difference]: Finished difference Result 1859 states and 2750 transitions. [2022-07-21 10:18:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:18:17,714 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-21 10:18:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:17,720 INFO L225 Difference]: With dead ends: 1859 [2022-07-21 10:18:17,721 INFO L226 Difference]: Without dead ends: 947 [2022-07-21 10:18:17,724 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-21 10:18:17,725 INFO L413 NwaCegarLoop]: 1319 mSDtfsCounter, 372 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:17,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 3515 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 10:18:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-21 10:18:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-07-21 10:18:17,807 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-21 10:18:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1370 transitions. [2022-07-21 10:18:17,815 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1370 transitions. Word has length 59 [2022-07-21 10:18:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:17,816 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1370 transitions. [2022-07-21 10:18:17,816 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-21 10:18:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1370 transitions. [2022-07-21 10:18:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 10:18:17,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:17,819 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-21 10:18:17,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 10:18:17,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1779924711, now seen corresponding path program 1 times [2022-07-21 10:18:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:17,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522394957] [2022-07-21 10:18:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:17,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:17,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:17,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:17,970 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-21 10:18:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:17,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522394957] [2022-07-21 10:18:17,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522394957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:17,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:17,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:18:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773981260] [2022-07-21 10:18:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:17,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:18:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:17,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:18:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:18:17,973 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-21 10:18:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:19,756 INFO L93 Difference]: Finished difference Result 1461 states and 2231 transitions. [2022-07-21 10:18:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 10:18:19,757 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-21 10:18:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:19,765 INFO L225 Difference]: With dead ends: 1461 [2022-07-21 10:18:19,765 INFO L226 Difference]: Without dead ends: 1459 [2022-07-21 10:18:19,766 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-21 10:18:19,767 INFO L413 NwaCegarLoop]: 2138 mSDtfsCounter, 1296 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 5314 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:19,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 5314 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 10:18:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2022-07-21 10:18:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 931. [2022-07-21 10:18:19,820 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-21 10:18:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1372 transitions. [2022-07-21 10:18:19,824 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1372 transitions. Word has length 62 [2022-07-21 10:18:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:19,825 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1372 transitions. [2022-07-21 10:18:19,825 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-21 10:18:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1372 transitions. [2022-07-21 10:18:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 10:18:19,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:19,828 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-21 10:18:19,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 10:18:19,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2124530077, now seen corresponding path program 1 times [2022-07-21 10:18:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:19,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61213421] [2022-07-21 10:18:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:19,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:19,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:19,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:19,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:19,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:19,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 10:18:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:19,945 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-21 10:18:19,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:19,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61213421] [2022-07-21 10:18:19,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61213421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:19,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:19,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:18:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40881403] [2022-07-21 10:18:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:19,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:18:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:19,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:18:19,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:18:19,948 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-21 10:18:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:21,697 INFO L93 Difference]: Finished difference Result 2375 states and 3581 transitions. [2022-07-21 10:18:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:18:21,697 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-21 10:18:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:21,715 INFO L225 Difference]: With dead ends: 2375 [2022-07-21 10:18:21,715 INFO L226 Difference]: Without dead ends: 1463 [2022-07-21 10:18:21,719 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-21 10:18:21,720 INFO L413 NwaCegarLoop]: 1818 mSDtfsCounter, 2025 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 3407 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:21,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 3407 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 10:18:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-07-21 10:18:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 932. [2022-07-21 10:18:21,781 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-21 10:18:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1373 transitions. [2022-07-21 10:18:21,786 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1373 transitions. Word has length 72 [2022-07-21 10:18:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:21,786 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1373 transitions. [2022-07-21 10:18:21,787 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-21 10:18:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1373 transitions. [2022-07-21 10:18:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 10:18:21,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:21,791 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-21 10:18:21,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 10:18:21,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash -45216834, now seen corresponding path program 1 times [2022-07-21 10:18:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:21,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361477748] [2022-07-21 10:18:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:21,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:21,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:21,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:21,937 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-21 10:18:21,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:21,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361477748] [2022-07-21 10:18:21,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361477748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:21,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:21,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 10:18:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002052994] [2022-07-21 10:18:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:21,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 10:18:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:21,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 10:18:21,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 10:18:21,944 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-21 10:18:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:24,755 INFO L93 Difference]: Finished difference Result 2242 states and 3484 transitions. [2022-07-21 10:18:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 10:18:24,756 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-21 10:18:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:24,773 INFO L225 Difference]: With dead ends: 2242 [2022-07-21 10:18:24,773 INFO L226 Difference]: Without dead ends: 2240 [2022-07-21 10:18:24,776 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-21 10:18:24,777 INFO L413 NwaCegarLoop]: 2587 mSDtfsCounter, 2635 mSDsluCounter, 5564 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 821 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 8151 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 821 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:24,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2833 Valid, 8151 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [821 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-21 10:18:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2022-07-21 10:18:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 934. [2022-07-21 10:18:24,876 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-21 10:18:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1376 transitions. [2022-07-21 10:18:24,880 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1376 transitions. Word has length 74 [2022-07-21 10:18:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:24,882 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1376 transitions. [2022-07-21 10:18:24,882 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-21 10:18:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1376 transitions. [2022-07-21 10:18:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 10:18:24,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:24,887 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-21 10:18:24,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 10:18:24,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1411070669, now seen corresponding path program 1 times [2022-07-21 10:18:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:24,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519651364] [2022-07-21 10:18:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 10:18:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:18:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 10:18:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 10:18:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:25,080 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-21 10:18:25,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:25,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519651364] [2022-07-21 10:18:25,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519651364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:25,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:25,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:18:25,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939590280] [2022-07-21 10:18:25,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:25,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:18:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:25,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:18:25,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:18:25,083 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-21 10:18:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:25,932 INFO L93 Difference]: Finished difference Result 1896 states and 2786 transitions. [2022-07-21 10:18:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:18:25,933 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-21 10:18:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:25,939 INFO L225 Difference]: With dead ends: 1896 [2022-07-21 10:18:25,939 INFO L226 Difference]: Without dead ends: 981 [2022-07-21 10:18:25,942 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-21 10:18:25,943 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-21 10:18:25,943 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-21 10:18:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-07-21 10:18:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 954. [2022-07-21 10:18:26,007 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-21 10:18:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1394 transitions. [2022-07-21 10:18:26,012 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1394 transitions. Word has length 104 [2022-07-21 10:18:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:26,012 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 1394 transitions. [2022-07-21 10:18:26,013 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-21 10:18:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1394 transitions. [2022-07-21 10:18:26,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 10:18:26,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:26,017 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-21 10:18:26,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 10:18:26,017 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:26,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:26,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1281162515, now seen corresponding path program 1 times [2022-07-21 10:18:26,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:26,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430876231] [2022-07-21 10:18:26,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 10:18:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 10:18:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:18:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 10:18:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:26,240 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-21 10:18:26,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:26,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430876231] [2022-07-21 10:18:26,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430876231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:26,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:26,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:18:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094466019] [2022-07-21 10:18:26,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:26,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:18:26,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:26,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:18:26,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:18:26,244 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-21 10:18:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:28,079 INFO L93 Difference]: Finished difference Result 2412 states and 3616 transitions. [2022-07-21 10:18:28,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:18:28,080 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-21 10:18:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:28,089 INFO L225 Difference]: With dead ends: 2412 [2022-07-21 10:18:28,089 INFO L226 Difference]: Without dead ends: 1497 [2022-07-21 10:18:28,093 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-21 10:18:28,096 INFO L413 NwaCegarLoop]: 1875 mSDtfsCounter, 2123 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 3502 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:28,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 3502 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 10:18:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2022-07-21 10:18:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 958. [2022-07-21 10:18:28,173 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-21 10:18:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1399 transitions. [2022-07-21 10:18:28,178 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1399 transitions. Word has length 106 [2022-07-21 10:18:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:28,179 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1399 transitions. [2022-07-21 10:18:28,179 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-21 10:18:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1399 transitions. [2022-07-21 10:18:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 10:18:28,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:28,183 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-21 10:18:28,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 10:18:28,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:28,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash 10856094, now seen corresponding path program 1 times [2022-07-21 10:18:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:28,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123171209] [2022-07-21 10:18:28,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:18:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 10:18:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 10:18:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 10:18:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:28,350 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-21 10:18:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:28,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123171209] [2022-07-21 10:18:28,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123171209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:28,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:28,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:18:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360988525] [2022-07-21 10:18:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:28,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:18:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:18:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:18:28,353 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-21 10:18:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:29,392 INFO L93 Difference]: Finished difference Result 1905 states and 2803 transitions. [2022-07-21 10:18:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:18:29,393 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-21 10:18:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:29,399 INFO L225 Difference]: With dead ends: 1905 [2022-07-21 10:18:29,399 INFO L226 Difference]: Without dead ends: 986 [2022-07-21 10:18:29,402 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-21 10:18:29,404 INFO L413 NwaCegarLoop]: 1312 mSDtfsCounter, 365 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:29,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2697 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 10:18:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-07-21 10:18:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 958. [2022-07-21 10:18:29,465 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-21 10:18:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1396 transitions. [2022-07-21 10:18:29,468 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1396 transitions. Word has length 109 [2022-07-21 10:18:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:29,470 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1396 transitions. [2022-07-21 10:18:29,471 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-21 10:18:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1396 transitions. [2022-07-21 10:18:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-21 10:18:29,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:29,476 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-21 10:18:29,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 10:18:29,476 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:29,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:29,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1938120389, now seen corresponding path program 1 times [2022-07-21 10:18:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:29,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661284064] [2022-07-21 10:18:29,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:29,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:18:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 10:18:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 10:18:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 10:18:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:29,616 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-21 10:18:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661284064] [2022-07-21 10:18:29,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661284064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:29,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:29,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:18:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952050700] [2022-07-21 10:18:29,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:29,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:18:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:18:29,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:18:29,619 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-21 10:18:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:31,209 INFO L93 Difference]: Finished difference Result 1507 states and 2274 transitions. [2022-07-21 10:18:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 10:18:31,209 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-21 10:18:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:31,218 INFO L225 Difference]: With dead ends: 1507 [2022-07-21 10:18:31,218 INFO L226 Difference]: Without dead ends: 1505 [2022-07-21 10:18:31,219 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-21 10:18:31,220 INFO L413 NwaCegarLoop]: 2130 mSDtfsCounter, 1292 mSDsluCounter, 3159 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 5289 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:31,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 5289 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-21 10:18:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2022-07-21 10:18:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 958. [2022-07-21 10:18:31,290 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-21 10:18:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1396 transitions. [2022-07-21 10:18:31,293 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1396 transitions. Word has length 112 [2022-07-21 10:18:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:31,293 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1396 transitions. [2022-07-21 10:18:31,293 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-21 10:18:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1396 transitions. [2022-07-21 10:18:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-21 10:18:31,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:31,298 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-21 10:18:31,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 10:18:31,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1129348236, now seen corresponding path program 1 times [2022-07-21 10:18:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:31,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031273333] [2022-07-21 10:18:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:18:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 10:18:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 10:18:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 10:18:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 10:18:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 10:18:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 10:18:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 10:18:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 10:18:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 10:18:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,501 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-21 10:18:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:31,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031273333] [2022-07-21 10:18:31,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031273333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:18:31,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132813267] [2022-07-21 10:18:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:31,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 10:18:31,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:18:31,507 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-21 10:18:31,537 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-21 10:18:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:31,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 10:18:31,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 10:18:32,147 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-21 10:18:32,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 10:18:32,302 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-21 10:18:32,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132813267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 10:18:32,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 10:18:32,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-07-21 10:18:32,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923166933] [2022-07-21 10:18:32,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 10:18:32,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 10:18:32,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:32,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 10:18:32,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-21 10:18:32,305 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-21 10:18:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:35,742 INFO L93 Difference]: Finished difference Result 3941 states and 6074 transitions. [2022-07-21 10:18:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 10:18:35,742 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-21 10:18:35,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:35,760 INFO L225 Difference]: With dead ends: 3941 [2022-07-21 10:18:35,761 INFO L226 Difference]: Without dead ends: 3022 [2022-07-21 10:18:35,766 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-21 10:18:35,767 INFO L413 NwaCegarLoop]: 1908 mSDtfsCounter, 7057 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 2969 mSolverCounterSat, 2972 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7470 SdHoareTripleChecker+Valid, 5958 SdHoareTripleChecker+Invalid, 5941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2972 IncrementalHoareTripleChecker+Valid, 2969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:35,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7470 Valid, 5958 Invalid, 5941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2972 Valid, 2969 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 10:18:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-07-21 10:18:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 965. [2022-07-21 10:18:35,881 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-21 10:18:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1405 transitions. [2022-07-21 10:18:35,884 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1405 transitions. Word has length 151 [2022-07-21 10:18:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:35,885 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1405 transitions. [2022-07-21 10:18:35,885 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-21 10:18:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1405 transitions. [2022-07-21 10:18:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-21 10:18:35,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:35,890 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-21 10:18:35,924 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-21 10:18:36,103 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-21 10:18:36,104 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:36,104 INFO L85 PathProgramCache]: Analyzing trace with hash -418278925, now seen corresponding path program 1 times [2022-07-21 10:18:36,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:36,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753685224] [2022-07-21 10:18:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:36,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 10:18:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:18:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:18:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 10:18:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:18:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 10:18:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 10:18:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 10:18:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:18:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 10:18:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 10:18:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:36,420 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-21 10:18:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:36,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753685224] [2022-07-21 10:18:36,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753685224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:36,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:36,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 10:18:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992175574] [2022-07-21 10:18:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:36,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 10:18:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 10:18:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 10:18:36,423 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-21 10:18:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:41,875 INFO L93 Difference]: Finished difference Result 3113 states and 4851 transitions. [2022-07-21 10:18:41,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 10:18:41,876 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-21 10:18:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:41,893 INFO L225 Difference]: With dead ends: 3113 [2022-07-21 10:18:41,893 INFO L226 Difference]: Without dead ends: 3111 [2022-07-21 10:18:41,894 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-21 10:18:41,895 INFO L413 NwaCegarLoop]: 3471 mSDtfsCounter, 3720 mSDsluCounter, 17639 mSDsCounter, 0 mSdLazyCounter, 7885 mSolverCounterSat, 1888 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3802 SdHoareTripleChecker+Valid, 21110 SdHoareTripleChecker+Invalid, 9773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1888 IncrementalHoareTripleChecker+Valid, 7885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:41,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3802 Valid, 21110 Invalid, 9773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1888 Valid, 7885 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-21 10:18:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-07-21 10:18:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 967. [2022-07-21 10:18:42,016 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-21 10:18:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1408 transitions. [2022-07-21 10:18:42,020 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1408 transitions. Word has length 160 [2022-07-21 10:18:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:42,020 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1408 transitions. [2022-07-21 10:18:42,020 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-21 10:18:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1408 transitions. [2022-07-21 10:18:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-21 10:18:42,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:42,027 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-21 10:18:42,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 10:18:42,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:42,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash -181531566, now seen corresponding path program 1 times [2022-07-21 10:18:42,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:42,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202729022] [2022-07-21 10:18:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 10:18:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:18:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:18:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 10:18:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:18:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 10:18:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 10:18:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 10:18:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:18:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 10:18:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 10:18:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:18:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:18:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 10:18:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 10:18:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:42,247 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-21 10:18:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:42,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202729022] [2022-07-21 10:18:42,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202729022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:42,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:42,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:18:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37281016] [2022-07-21 10:18:42,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:42,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:18:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:42,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:18:42,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:18:42,250 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-21 10:18:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:43,353 INFO L93 Difference]: Finished difference Result 1923 states and 2815 transitions. [2022-07-21 10:18:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:18:43,354 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-21 10:18:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:43,358 INFO L225 Difference]: With dead ends: 1923 [2022-07-21 10:18:43,358 INFO L226 Difference]: Without dead ends: 995 [2022-07-21 10:18:43,361 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-21 10:18:43,361 INFO L413 NwaCegarLoop]: 1311 mSDtfsCounter, 724 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:43,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2740 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 10:18:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-21 10:18:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-21 10:18:43,440 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-21 10:18:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1405 transitions. [2022-07-21 10:18:43,444 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1405 transitions. Word has length 202 [2022-07-21 10:18:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:43,444 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1405 transitions. [2022-07-21 10:18:43,444 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-21 10:18:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1405 transitions. [2022-07-21 10:18:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-21 10:18:43,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:43,450 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-21 10:18:43,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 10:18:43,450 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:43,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1912426699, now seen corresponding path program 1 times [2022-07-21 10:18:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:43,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001369529] [2022-07-21 10:18:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 10:18:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:18:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:18:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 10:18:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:18:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 10:18:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 10:18:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 10:18:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:18:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 10:18:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 10:18:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:18:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:18:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 10:18:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 10:18:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:18:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 10:18:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 10:18:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:43,647 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-21 10:18:43,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:43,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001369529] [2022-07-21 10:18:43,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001369529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:43,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:43,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:18:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271851045] [2022-07-21 10:18:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:43,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:18:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:43,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:18:43,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:18:43,650 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-21 10:18:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:44,657 INFO L93 Difference]: Finished difference Result 1923 states and 2809 transitions. [2022-07-21 10:18:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:18:44,658 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-21 10:18:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:44,662 INFO L225 Difference]: With dead ends: 1923 [2022-07-21 10:18:44,663 INFO L226 Difference]: Without dead ends: 995 [2022-07-21 10:18:44,665 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-21 10:18:44,666 INFO L413 NwaCegarLoop]: 1305 mSDtfsCounter, 365 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:44,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 3286 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 10:18:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-21 10:18:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-21 10:18:44,774 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-21 10:18:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1402 transitions. [2022-07-21 10:18:44,777 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1402 transitions. Word has length 205 [2022-07-21 10:18:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:44,778 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1402 transitions. [2022-07-21 10:18:44,778 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-21 10:18:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1402 transitions. [2022-07-21 10:18:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-21 10:18:44,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:44,784 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-21 10:18:44,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 10:18:44,784 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:44,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:44,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2088105750, now seen corresponding path program 1 times [2022-07-21 10:18:44,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:44,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981913219] [2022-07-21 10:18:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 10:18:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:18:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:18:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 10:18:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:18:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 10:18:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 10:18:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 10:18:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:18:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 10:18:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 10:18:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:18:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:18:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:18:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 10:18:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-21 10:18:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:44,965 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-21 10:18:44,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:44,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981913219] [2022-07-21 10:18:44,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981913219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:44,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:18:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902576028] [2022-07-21 10:18:44,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:18:44,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:44,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:18:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:18:44,968 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-21 10:18:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:45,935 INFO L93 Difference]: Finished difference Result 1923 states and 2803 transitions. [2022-07-21 10:18:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:18:45,936 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-21 10:18:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:45,941 INFO L225 Difference]: With dead ends: 1923 [2022-07-21 10:18:45,941 INFO L226 Difference]: Without dead ends: 995 [2022-07-21 10:18:45,949 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-21 10:18:45,950 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.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:45,950 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.9s Time] [2022-07-21 10:18:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-21 10:18:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-21 10:18:46,059 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-21 10:18:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1399 transitions. [2022-07-21 10:18:46,062 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1399 transitions. Word has length 208 [2022-07-21 10:18:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:46,063 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1399 transitions. [2022-07-21 10:18:46,063 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-21 10:18:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1399 transitions. [2022-07-21 10:18:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-21 10:18:46,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:46,069 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-21 10:18:46,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 10:18:46,069 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash 338207523, now seen corresponding path program 1 times [2022-07-21 10:18:46,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:46,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185451904] [2022-07-21 10:18:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 10:18:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:18:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:18:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 10:18:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:18:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 10:18:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 10:18:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 10:18:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:18:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 10:18:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 10:18:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:18:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:18:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:18:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 10:18:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 10:18:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-21 10:18:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:46,264 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-21 10:18:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:46,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185451904] [2022-07-21 10:18:46,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185451904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:46,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:46,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:18:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929207068] [2022-07-21 10:18:46,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:46,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:18:46,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:18:46,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:18:46,268 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-21 10:18:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:47,155 INFO L93 Difference]: Finished difference Result 1923 states and 2797 transitions. [2022-07-21 10:18:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:18:47,164 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-21 10:18:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:47,169 INFO L225 Difference]: With dead ends: 1923 [2022-07-21 10:18:47,169 INFO L226 Difference]: Without dead ends: 995 [2022-07-21 10:18:47,174 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-21 10:18:47,175 INFO L413 NwaCegarLoop]: 1302 mSDtfsCounter, 730 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:47,176 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-21 10:18:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-21 10:18:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-21 10:18:47,277 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-21 10:18:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1396 transitions. [2022-07-21 10:18:47,281 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1396 transitions. Word has length 211 [2022-07-21 10:18:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:47,282 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1396 transitions. [2022-07-21 10:18:47,282 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-21 10:18:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1396 transitions. [2022-07-21 10:18:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-21 10:18:47,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:18:47,288 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-21 10:18:47,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 10:18:47,288 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:18:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:18:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash -978948990, now seen corresponding path program 1 times [2022-07-21 10:18:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:18:47,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572638364] [2022-07-21 10:18:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:18:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:18:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:18:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:18:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:18:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 10:18:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 10:18:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:18:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:18:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 10:18:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:18:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:18:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 10:18:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 10:18:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 10:18:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:18:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 10:18:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 10:18:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:18:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:18:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:18:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:18:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:18:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 10:18:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 10:18:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:18:47,588 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-21 10:18:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:18:47,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572638364] [2022-07-21 10:18:47,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572638364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:18:47,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:18:47,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 10:18:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428605689] [2022-07-21 10:18:47,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:18:47,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 10:18:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:18:47,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 10:18:47,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 10:18:47,592 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-21 10:18:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:18:53,235 INFO L93 Difference]: Finished difference Result 3553 states and 5556 transitions. [2022-07-21 10:18:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 10:18:53,235 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-21 10:18:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:18:53,236 INFO L225 Difference]: With dead ends: 3553 [2022-07-21 10:18:53,236 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 10:18:53,243 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-21 10:18:53,243 INFO L413 NwaCegarLoop]: 3665 mSDtfsCounter, 3763 mSDsluCounter, 18553 mSDsCounter, 0 mSdLazyCounter, 8720 mSolverCounterSat, 1943 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3958 SdHoareTripleChecker+Valid, 22218 SdHoareTripleChecker+Invalid, 10663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1943 IncrementalHoareTripleChecker+Valid, 8720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:18:53,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3958 Valid, 22218 Invalid, 10663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1943 Valid, 8720 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-21 10:18:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 10:18:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 10:18:53,245 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-21 10:18:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 10:18:53,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2022-07-21 10:18:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:18:53,246 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 10:18:53,247 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-21 10:18:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 10:18:53,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 10:18:53,249 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 10:18:53,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 10:18:53,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.