/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 01:27:34,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 01:27:34,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 01:27:34,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 01:27:34,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 01:27:34,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 01:27:34,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 01:27:34,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 01:27:34,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 01:27:34,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 01:27:34,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 01:27:34,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 01:27:34,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 01:27:34,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 01:27:34,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 01:27:34,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 01:27:34,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 01:27:34,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 01:27:34,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 01:27:34,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 01:27:34,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 01:27:34,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 01:27:34,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 01:27:34,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 01:27:34,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 01:27:34,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 01:27:34,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 01:27:34,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 01:27:34,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 01:27:34,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 01:27:34,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 01:27:34,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 01:27:34,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 01:27:34,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 01:27:34,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 01:27:34,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 01:27:34,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 01:27:34,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 01:27:34,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 01:27:34,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 01:27:34,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 01:27:34,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-31 01:27:34,617 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 01:27:34,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 01:27:34,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 01:27:34,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 01:27:34,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 01:27:34,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 01:27:34,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 01:27:34,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 01:27:34,620 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 01:27:34,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 01:27:34,621 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 01:27:34,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 01:27:34,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 01:27:34,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 01:27:34,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 01:27:34,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 01:27:34,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 01:27:34,622 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 01:27:34,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 01:27:34,622 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 01:27:34,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 01:27:34,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 01:27:34,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 01:27:34,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 01:27:34,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:27:34,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 01:27:34,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 01:27:34,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 01:27:34,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 01:27:34,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 01:27:34,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 01:27:34,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 01:27:34,624 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 01:27:34,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 01:27:34,624 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 01:27:34,624 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-03-31 01:27:34,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 01:27:34,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 01:27:34,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 01:27:34,871 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 01:27:34,871 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 01:27:34,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2023-03-31 01:27:35,984 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 01:27:36,217 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 01:27:36,217 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2023-03-31 01:27:36,226 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8568ca28/adeee72763ef4b9ab082a86ffe56e70d/FLAG21f23012f [2023-03-31 01:27:36,239 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8568ca28/adeee72763ef4b9ab082a86ffe56e70d [2023-03-31 01:27:36,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 01:27:36,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 01:27:36,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 01:27:36,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 01:27:36,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 01:27:36,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420ff6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36, skipping insertion in model container [2023-03-31 01:27:36,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 01:27:36,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 01:27:36,486 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2023-03-31 01:27:36,496 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:27:36,512 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 01:27:36,595 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2023-03-31 01:27:36,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 01:27:36,610 INFO L208 MainTranslator]: Completed translation [2023-03-31 01:27:36,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36 WrapperNode [2023-03-31 01:27:36,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 01:27:36,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 01:27:36,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 01:27:36,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 01:27:36,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,662 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 01:27:36,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 01:27:36,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 01:27:36,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 01:27:36,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (1/1) ... [2023-03-31 01:27:36,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 01:27:36,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 01:27:36,722 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) [2023-03-31 01:27:36,748 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 [2023-03-31 01:27:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 01:27:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 01:27:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 01:27:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-03-31 01:27:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2023-03-31 01:27:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2023-03-31 01:27:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2023-03-31 01:27:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2023-03-31 01:27:36,771 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2023-03-31 01:27:36,772 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2023-03-31 01:27:36,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 01:27:36,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-03-31 01:27:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 01:27:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 01:27:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 01:27:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 01:27:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2023-03-31 01:27:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2023-03-31 01:27:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure read [2023-03-31 01:27:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure write [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2023-03-31 01:27:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure init [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure check [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 01:27:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 01:27:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 01:27:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 01:27:36,909 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 01:27:36,911 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 01:27:37,484 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 01:27:37,496 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 01:27:37,497 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-03-31 01:27:37,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:27:37 BoogieIcfgContainer [2023-03-31 01:27:37,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 01:27:37,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 01:27:37,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 01:27:37,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 01:27:37,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 01:27:36" (1/3) ... [2023-03-31 01:27:37,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb2a840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:27:37, skipping insertion in model container [2023-03-31 01:27:37,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 01:27:36" (2/3) ... [2023-03-31 01:27:37,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb2a840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 01:27:37, skipping insertion in model container [2023-03-31 01:27:37,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 01:27:37" (3/3) ... [2023-03-31 01:27:37,506 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2023-03-31 01:27:37,525 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 01:27:37,525 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 01:27:37,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 01:27:37,588 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6450ac6e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 01:27:37,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 01:27:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 152 states have (on average 1.506578947368421) internal successors, (229), 153 states have internal predecessors, (229), 42 states have call successors, (42), 19 states have call predecessors, (42), 19 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-03-31 01:27:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-03-31 01:27:37,601 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:37,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:27:37,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:37,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash 440919121, now seen corresponding path program 1 times [2023-03-31 01:27:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:37,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569469133] [2023-03-31 01:27:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:37,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:27:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-03-31 01:27:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-03-31 01:27:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-03-31 01:27:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:27:38,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569469133] [2023-03-31 01:27:38,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569469133] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:38,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:38,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-03-31 01:27:38,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863229592] [2023-03-31 01:27:38,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:38,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 01:27:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:38,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 01:27:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-03-31 01:27:38,300 INFO L87 Difference]: Start difference. First operand has 215 states, 152 states have (on average 1.506578947368421) internal successors, (229), 153 states have internal predecessors, (229), 42 states have call successors, (42), 19 states have call predecessors, (42), 19 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-03-31 01:27:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:27:39,787 INFO L93 Difference]: Finished difference Result 407 states and 621 transitions. [2023-03-31 01:27:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 01:27:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2023-03-31 01:27:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:27:39,802 INFO L225 Difference]: With dead ends: 407 [2023-03-31 01:27:39,803 INFO L226 Difference]: Without dead ends: 210 [2023-03-31 01:27:39,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2023-03-31 01:27:39,813 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 782 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:27:39,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 104 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-31 01:27:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-03-31 01:27:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-03-31 01:27:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 149 states have internal predecessors, (222), 42 states have call successors, (42), 19 states have call predecessors, (42), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-03-31 01:27:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 305 transitions. [2023-03-31 01:27:39,924 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 305 transitions. Word has length 56 [2023-03-31 01:27:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:27:39,924 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 305 transitions. [2023-03-31 01:27:39,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-03-31 01:27:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 305 transitions. [2023-03-31 01:27:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-03-31 01:27:39,927 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:39,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:27:39,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 01:27:39,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:39,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash -456474157, now seen corresponding path program 1 times [2023-03-31 01:27:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:39,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464450156] [2023-03-31 01:27:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:39,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:27:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-03-31 01:27:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-03-31 01:27:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-03-31 01:27:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:27:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464450156] [2023-03-31 01:27:40,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464450156] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:40,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:40,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-03-31 01:27:40,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46458508] [2023-03-31 01:27:40,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:40,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-03-31 01:27:40,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:40,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-03-31 01:27:40,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-03-31 01:27:40,426 INFO L87 Difference]: Start difference. First operand 210 states and 305 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-03-31 01:27:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:27:42,556 INFO L93 Difference]: Finished difference Result 411 states and 595 transitions. [2023-03-31 01:27:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-31 01:27:42,556 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2023-03-31 01:27:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:27:42,559 INFO L225 Difference]: With dead ends: 411 [2023-03-31 01:27:42,559 INFO L226 Difference]: Without dead ends: 220 [2023-03-31 01:27:42,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2023-03-31 01:27:42,562 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 791 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 01:27:42,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 121 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-03-31 01:27:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-03-31 01:27:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2023-03-31 01:27:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 149 states have internal predecessors, (210), 42 states have call successors, (42), 19 states have call predecessors, (42), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-03-31 01:27:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 293 transitions. [2023-03-31 01:27:42,637 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 293 transitions. Word has length 56 [2023-03-31 01:27:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:27:42,637 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 293 transitions. [2023-03-31 01:27:42,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-03-31 01:27:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 293 transitions. [2023-03-31 01:27:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-03-31 01:27:42,639 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:42,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:27:42,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 01:27:42,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:42,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1503560152, now seen corresponding path program 1 times [2023-03-31 01:27:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:42,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124441643] [2023-03-31 01:27:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:42,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:42,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:42,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:27:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:27:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:27:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:43,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:43,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:27:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 01:27:43,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:43,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124441643] [2023-03-31 01:27:43,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124441643] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:43,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:43,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-03-31 01:27:43,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357046906] [2023-03-31 01:27:43,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:43,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 01:27:43,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:43,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 01:27:43,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-03-31 01:27:43,065 INFO L87 Difference]: Start difference. First operand 210 states and 293 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 10 states have call predecessors, (13), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-03-31 01:27:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:27:44,549 INFO L93 Difference]: Finished difference Result 400 states and 571 transitions. [2023-03-31 01:27:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-03-31 01:27:44,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 10 states have call predecessors, (13), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2023-03-31 01:27:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:27:44,551 INFO L225 Difference]: With dead ends: 400 [2023-03-31 01:27:44,551 INFO L226 Difference]: Without dead ends: 214 [2023-03-31 01:27:44,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:27:44,553 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 547 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:27:44,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 95 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 01:27:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-03-31 01:27:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-03-31 01:27:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 152 states have internal predecessors, (213), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-03-31 01:27:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 296 transitions. [2023-03-31 01:27:44,611 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 296 transitions. Word has length 67 [2023-03-31 01:27:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:27:44,617 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 296 transitions. [2023-03-31 01:27:44,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 10 states have call predecessors, (13), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-03-31 01:27:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 296 transitions. [2023-03-31 01:27:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-03-31 01:27:44,622 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:44,622 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:27:44,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 01:27:44,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:44,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash 727390458, now seen corresponding path program 1 times [2023-03-31 01:27:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:44,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728313576] [2023-03-31 01:27:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:44,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:44,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:27:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:44,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:27:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:27:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:27:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:27:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:27:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-03-31 01:27:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:27:45,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:45,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728313576] [2023-03-31 01:27:45,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728313576] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:45,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:45,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-03-31 01:27:45,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088142307] [2023-03-31 01:27:45,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:45,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-03-31 01:27:45,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:45,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-03-31 01:27:45,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-03-31 01:27:45,178 INFO L87 Difference]: Start difference. First operand 214 states and 296 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 7 states have internal predecessors, (56), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:27:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:27:47,971 INFO L93 Difference]: Finished difference Result 467 states and 646 transitions. [2023-03-31 01:27:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-03-31 01:27:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 7 states have internal predecessors, (56), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 89 [2023-03-31 01:27:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:27:47,980 INFO L225 Difference]: With dead ends: 467 [2023-03-31 01:27:47,980 INFO L226 Difference]: Without dead ends: 277 [2023-03-31 01:27:47,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2023-03-31 01:27:47,990 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1713 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-03-31 01:27:47,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 90 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-03-31 01:27:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-03-31 01:27:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2023-03-31 01:27:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 194 states have (on average 1.3865979381443299) internal successors, (269), 196 states have internal predecessors, (269), 52 states have call successors, (52), 30 states have call predecessors, (52), 29 states have return successors, (52), 49 states have call predecessors, (52), 51 states have call successors, (52) [2023-03-31 01:27:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 373 transitions. [2023-03-31 01:27:48,078 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 373 transitions. Word has length 89 [2023-03-31 01:27:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:27:48,080 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 373 transitions. [2023-03-31 01:27:48,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 7 states have internal predecessors, (56), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:27:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 373 transitions. [2023-03-31 01:27:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-03-31 01:27:48,089 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:48,090 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:27:48,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-31 01:27:48,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:48,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -44800368, now seen corresponding path program 1 times [2023-03-31 01:27:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:48,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165320607] [2023-03-31 01:27:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:27:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:27:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:27:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:27:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:27:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-03-31 01:27:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-03-31 01:27:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:27:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:48,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165320607] [2023-03-31 01:27:48,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165320607] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:48,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:48,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-03-31 01:27:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718382902] [2023-03-31 01:27:48,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:48,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-03-31 01:27:48,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:48,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-03-31 01:27:48,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-03-31 01:27:48,651 INFO L87 Difference]: Start difference. First operand 276 states and 373 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 7 states have internal predecessors, (57), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:27:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:27:51,153 INFO L93 Difference]: Finished difference Result 473 states and 654 transitions. [2023-03-31 01:27:51,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-03-31 01:27:51,153 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 7 states have internal predecessors, (57), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2023-03-31 01:27:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:27:51,155 INFO L225 Difference]: With dead ends: 473 [2023-03-31 01:27:51,155 INFO L226 Difference]: Without dead ends: 280 [2023-03-31 01:27:51,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2023-03-31 01:27:51,157 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1924 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 01:27:51,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 83 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [692 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-03-31 01:27:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-03-31 01:27:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2023-03-31 01:27:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 194 states have (on average 1.3865979381443299) internal successors, (269), 196 states have internal predecessors, (269), 52 states have call successors, (52), 30 states have call predecessors, (52), 29 states have return successors, (52), 49 states have call predecessors, (52), 51 states have call successors, (52) [2023-03-31 01:27:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 373 transitions. [2023-03-31 01:27:51,211 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 373 transitions. Word has length 90 [2023-03-31 01:27:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:27:51,211 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 373 transitions. [2023-03-31 01:27:51,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 7 states have internal predecessors, (57), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:27:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 373 transitions. [2023-03-31 01:27:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-03-31 01:27:51,213 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:51,213 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:27:51,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-31 01:27:51,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:51,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash -898667211, now seen corresponding path program 1 times [2023-03-31 01:27:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629246171] [2023-03-31 01:27:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:27:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:27:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:27:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:27:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:27:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:27:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-03-31 01:27:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:27:51,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:51,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629246171] [2023-03-31 01:27:51,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629246171] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:51,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:51,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-03-31 01:27:51,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871106097] [2023-03-31 01:27:51,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:51,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-03-31 01:27:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:51,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-03-31 01:27:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-03-31 01:27:51,683 INFO L87 Difference]: Start difference. First operand 276 states and 373 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:27:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:27:53,949 INFO L93 Difference]: Finished difference Result 474 states and 658 transitions. [2023-03-31 01:27:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-03-31 01:27:53,949 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 92 [2023-03-31 01:27:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:27:53,951 INFO L225 Difference]: With dead ends: 474 [2023-03-31 01:27:53,951 INFO L226 Difference]: Without dead ends: 281 [2023-03-31 01:27:53,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2023-03-31 01:27:53,953 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1865 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1871 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:27:53,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1871 Valid, 88 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-03-31 01:27:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-03-31 01:27:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2023-03-31 01:27:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 197 states have internal predecessors, (270), 52 states have call successors, (52), 30 states have call predecessors, (52), 29 states have return successors, (52), 49 states have call predecessors, (52), 51 states have call successors, (52) [2023-03-31 01:27:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 374 transitions. [2023-03-31 01:27:53,999 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 374 transitions. Word has length 92 [2023-03-31 01:27:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:27:54,000 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 374 transitions. [2023-03-31 01:27:54,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 01:27:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 374 transitions. [2023-03-31 01:27:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-03-31 01:27:54,001 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:54,001 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:27:54,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-31 01:27:54,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:54,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1603329218, now seen corresponding path program 1 times [2023-03-31 01:27:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:54,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242014009] [2023-03-31 01:27:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:54,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:27:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:27:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:27:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:27:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:27:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:27:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-03-31 01:27:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:27:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:54,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242014009] [2023-03-31 01:27:54,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242014009] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:54,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:54,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-03-31 01:27:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940789204] [2023-03-31 01:27:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:54,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 01:27:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 01:27:54,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-03-31 01:27:54,301 INFO L87 Difference]: Start difference. First operand 277 states and 374 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:27:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:27:56,588 INFO L93 Difference]: Finished difference Result 685 states and 952 transitions. [2023-03-31 01:27:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-03-31 01:27:56,589 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 92 [2023-03-31 01:27:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:27:56,593 INFO L225 Difference]: With dead ends: 685 [2023-03-31 01:27:56,593 INFO L226 Difference]: Without dead ends: 491 [2023-03-31 01:27:56,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:27:56,595 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2274 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 814 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2304 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 814 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-03-31 01:27:56,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2304 Valid, 95 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [814 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-03-31 01:27:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-03-31 01:27:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 476. [2023-03-31 01:27:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 334 states have (on average 1.407185628742515) internal successors, (470), 339 states have internal predecessors, (470), 92 states have call successors, (92), 48 states have call predecessors, (92), 49 states have return successors, (96), 88 states have call predecessors, (96), 91 states have call successors, (96) [2023-03-31 01:27:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 658 transitions. [2023-03-31 01:27:56,688 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 658 transitions. Word has length 92 [2023-03-31 01:27:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:27:56,688 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 658 transitions. [2023-03-31 01:27:56,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:27:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 658 transitions. [2023-03-31 01:27:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-03-31 01:27:56,689 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:56,689 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:27:56,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-03-31 01:27:56,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:56,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash -972039556, now seen corresponding path program 1 times [2023-03-31 01:27:56,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:56,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108323853] [2023-03-31 01:27:56,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:27:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:27:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:27:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-03-31 01:27:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-03-31 01:27:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:56,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:57,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:27:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-03-31 01:27:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:27:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108323853] [2023-03-31 01:27:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108323853] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:57,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:57,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-03-31 01:27:57,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956613185] [2023-03-31 01:27:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:57,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 01:27:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 01:27:57,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-03-31 01:27:57,012 INFO L87 Difference]: Start difference. First operand 476 states and 658 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:27:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:27:59,345 INFO L93 Difference]: Finished difference Result 852 states and 1193 transitions. [2023-03-31 01:27:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-03-31 01:27:59,349 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 95 [2023-03-31 01:27:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:27:59,352 INFO L225 Difference]: With dead ends: 852 [2023-03-31 01:27:59,352 INFO L226 Difference]: Without dead ends: 491 [2023-03-31 01:27:59,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:27:59,354 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1012 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-03-31 01:27:59,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 129 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-03-31 01:27:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-03-31 01:27:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 476. [2023-03-31 01:27:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 334 states have (on average 1.404191616766467) internal successors, (469), 339 states have internal predecessors, (469), 92 states have call successors, (92), 48 states have call predecessors, (92), 49 states have return successors, (95), 88 states have call predecessors, (95), 91 states have call successors, (95) [2023-03-31 01:27:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 656 transitions. [2023-03-31 01:27:59,453 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 656 transitions. Word has length 95 [2023-03-31 01:27:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:27:59,454 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 656 transitions. [2023-03-31 01:27:59,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:27:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 656 transitions. [2023-03-31 01:27:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-03-31 01:27:59,455 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:27:59,455 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:27:59,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-03-31 01:27:59,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:27:59,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:27:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1523924512, now seen corresponding path program 1 times [2023-03-31 01:27:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:27:59,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775758901] [2023-03-31 01:27:59,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:27:59,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:27:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:27:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:27:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:27:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:27:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:27:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:27:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:27:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:27:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:27:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:27:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:27:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:27:59,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:27:59,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775758901] [2023-03-31 01:27:59,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775758901] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:27:59,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:27:59,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-03-31 01:27:59,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824737753] [2023-03-31 01:27:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:27:59,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 01:27:59,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:27:59,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 01:27:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-03-31 01:27:59,791 INFO L87 Difference]: Start difference. First operand 476 states and 656 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:02,175 INFO L93 Difference]: Finished difference Result 1178 states and 1662 transitions. [2023-03-31 01:28:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-03-31 01:28:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 93 [2023-03-31 01:28:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:02,180 INFO L225 Difference]: With dead ends: 1178 [2023-03-31 01:28:02,180 INFO L226 Difference]: Without dead ends: 817 [2023-03-31 01:28:02,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:28:02,184 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1366 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:02,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 97 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-03-31 01:28:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2023-03-31 01:28:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 630. [2023-03-31 01:28:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 440 states have (on average 1.4090909090909092) internal successors, (620), 448 states have internal predecessors, (620), 126 states have call successors, (126), 60 states have call predecessors, (126), 63 states have return successors, (133), 121 states have call predecessors, (133), 125 states have call successors, (133) [2023-03-31 01:28:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 879 transitions. [2023-03-31 01:28:02,420 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 879 transitions. Word has length 93 [2023-03-31 01:28:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:02,421 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 879 transitions. [2023-03-31 01:28:02,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-03-31 01:28:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 879 transitions. [2023-03-31 01:28:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-03-31 01:28:02,425 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:02,426 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:28:02,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-31 01:28:02,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:02,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:02,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1491179106, now seen corresponding path program 1 times [2023-03-31 01:28:02,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:02,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256334021] [2023-03-31 01:28:02,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:02,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:02,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256334021] [2023-03-31 01:28:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256334021] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:02,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:02,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114388038] [2023-03-31 01:28:02,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:02,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:02,838 INFO L87 Difference]: Start difference. First operand 630 states and 879 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 12 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-03-31 01:28:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:04,548 INFO L93 Difference]: Finished difference Result 1151 states and 1634 transitions. [2023-03-31 01:28:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:04,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 12 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2023-03-31 01:28:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:04,552 INFO L225 Difference]: With dead ends: 1151 [2023-03-31 01:28:04,552 INFO L226 Difference]: Without dead ends: 645 [2023-03-31 01:28:04,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:04,555 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1384 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:04,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 103 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-03-31 01:28:04,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2023-03-31 01:28:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2023-03-31 01:28:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 452 states have (on average 1.3982300884955752) internal successors, (632), 460 states have internal predecessors, (632), 126 states have call successors, (126), 63 states have call predecessors, (126), 66 states have return successors, (133), 121 states have call predecessors, (133), 125 states have call successors, (133) [2023-03-31 01:28:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 891 transitions. [2023-03-31 01:28:04,695 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 891 transitions. Word has length 93 [2023-03-31 01:28:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:04,696 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 891 transitions. [2023-03-31 01:28:04,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 12 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-03-31 01:28:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 891 transitions. [2023-03-31 01:28:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-03-31 01:28:04,697 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:04,697 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:28:04,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-03-31 01:28:04,698 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:04,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1795844420, now seen corresponding path program 1 times [2023-03-31 01:28:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693420223] [2023-03-31 01:28:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-03-31 01:28:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:04,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-03-31 01:28:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-03-31 01:28:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693420223] [2023-03-31 01:28:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693420223] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:05,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:05,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-03-31 01:28:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063454904] [2023-03-31 01:28:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:05,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 01:28:05,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:05,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 01:28:05,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-03-31 01:28:05,021 INFO L87 Difference]: Start difference. First operand 645 states and 891 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (18), 12 states have call predecessors, (18), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-03-31 01:28:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:07,523 INFO L93 Difference]: Finished difference Result 1358 states and 1901 transitions. [2023-03-31 01:28:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-03-31 01:28:07,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (18), 12 states have call predecessors, (18), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 103 [2023-03-31 01:28:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:07,529 INFO L225 Difference]: With dead ends: 1358 [2023-03-31 01:28:07,529 INFO L226 Difference]: Without dead ends: 837 [2023-03-31 01:28:07,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-03-31 01:28:07,532 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 621 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:07,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 122 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-03-31 01:28:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2023-03-31 01:28:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 645. [2023-03-31 01:28:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 452 states have (on average 1.3960176991150441) internal successors, (631), 460 states have internal predecessors, (631), 126 states have call successors, (126), 63 states have call predecessors, (126), 66 states have return successors, (132), 121 states have call predecessors, (132), 125 states have call successors, (132) [2023-03-31 01:28:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 889 transitions. [2023-03-31 01:28:07,680 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 889 transitions. Word has length 103 [2023-03-31 01:28:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:07,681 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 889 transitions. [2023-03-31 01:28:07,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (18), 12 states have call predecessors, (18), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-03-31 01:28:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 889 transitions. [2023-03-31 01:28:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-03-31 01:28:07,682 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:07,682 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:28:07,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-03-31 01:28:07,682 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:07,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash 484162240, now seen corresponding path program 1 times [2023-03-31 01:28:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869115711] [2023-03-31 01:28:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:07,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:07,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:07,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:08,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:08,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869115711] [2023-03-31 01:28:08,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869115711] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:08,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:08,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536083069] [2023-03-31 01:28:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:08,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:08,111 INFO L87 Difference]: Start difference. First operand 645 states and 889 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 12 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-03-31 01:28:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:09,740 INFO L93 Difference]: Finished difference Result 1181 states and 1662 transitions. [2023-03-31 01:28:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:09,740 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 12 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2023-03-31 01:28:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:09,744 INFO L225 Difference]: With dead ends: 1181 [2023-03-31 01:28:09,744 INFO L226 Difference]: Without dead ends: 660 [2023-03-31 01:28:09,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:09,747 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1237 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:09,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 103 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 01:28:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2023-03-31 01:28:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2023-03-31 01:28:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 464 states have (on average 1.3857758620689655) internal successors, (643), 472 states have internal predecessors, (643), 126 states have call successors, (126), 66 states have call predecessors, (126), 69 states have return successors, (132), 121 states have call predecessors, (132), 125 states have call successors, (132) [2023-03-31 01:28:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 901 transitions. [2023-03-31 01:28:09,929 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 901 transitions. Word has length 101 [2023-03-31 01:28:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:09,929 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 901 transitions. [2023-03-31 01:28:09,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 12 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-03-31 01:28:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 901 transitions. [2023-03-31 01:28:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-03-31 01:28:09,931 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:09,931 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:28:09,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-03-31 01:28:09,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:09,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash -190290678, now seen corresponding path program 1 times [2023-03-31 01:28:09,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:09,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828425597] [2023-03-31 01:28:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:09,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:28:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:10,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828425597] [2023-03-31 01:28:10,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828425597] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:10,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:10,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:10,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120886175] [2023-03-31 01:28:10,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:10,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:10,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:10,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:10,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:10,360 INFO L87 Difference]: Start difference. First operand 660 states and 901 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-03-31 01:28:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:11,804 INFO L93 Difference]: Finished difference Result 1208 states and 1674 transitions. [2023-03-31 01:28:11,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:11,804 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2023-03-31 01:28:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:11,808 INFO L225 Difference]: With dead ends: 1208 [2023-03-31 01:28:11,808 INFO L226 Difference]: Without dead ends: 672 [2023-03-31 01:28:11,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:11,811 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 927 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:11,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 103 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-03-31 01:28:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2023-03-31 01:28:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2023-03-31 01:28:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 473 states have (on average 1.3784355179704018) internal successors, (652), 481 states have internal predecessors, (652), 126 states have call successors, (126), 69 states have call predecessors, (126), 72 states have return successors, (132), 121 states have call predecessors, (132), 125 states have call successors, (132) [2023-03-31 01:28:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 910 transitions. [2023-03-31 01:28:11,994 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 910 transitions. Word has length 109 [2023-03-31 01:28:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:11,995 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 910 transitions. [2023-03-31 01:28:11,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-03-31 01:28:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 910 transitions. [2023-03-31 01:28:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-03-31 01:28:11,997 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:11,997 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:28:11,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-03-31 01:28:11,997 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:11,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash -43773784, now seen corresponding path program 1 times [2023-03-31 01:28:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158843404] [2023-03-31 01:28:11,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:28:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-31 01:28:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158843404] [2023-03-31 01:28:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158843404] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895010643] [2023-03-31 01:28:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:12,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:12,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:12,375 INFO L87 Difference]: Start difference. First operand 672 states and 910 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-03-31 01:28:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:13,915 INFO L93 Difference]: Finished difference Result 1235 states and 1704 transitions. [2023-03-31 01:28:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:13,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2023-03-31 01:28:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:13,922 INFO L225 Difference]: With dead ends: 1235 [2023-03-31 01:28:13,922 INFO L226 Difference]: Without dead ends: 687 [2023-03-31 01:28:13,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:13,924 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 958 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:13,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 121 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 01:28:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-03-31 01:28:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2023-03-31 01:28:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 485 states have (on average 1.3690721649484536) internal successors, (664), 493 states have internal predecessors, (664), 126 states have call successors, (126), 72 states have call predecessors, (126), 75 states have return successors, (132), 121 states have call predecessors, (132), 125 states have call successors, (132) [2023-03-31 01:28:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 922 transitions. [2023-03-31 01:28:14,076 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 922 transitions. Word has length 109 [2023-03-31 01:28:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:14,076 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 922 transitions. [2023-03-31 01:28:14,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-03-31 01:28:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 922 transitions. [2023-03-31 01:28:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-03-31 01:28:14,078 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:14,078 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:28:14,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-03-31 01:28:14,079 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:14,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash 797477226, now seen corresponding path program 1 times [2023-03-31 01:28:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:14,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757814215] [2023-03-31 01:28:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:28:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-03-31 01:28:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-03-31 01:28:14,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757814215] [2023-03-31 01:28:14,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757814215] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:14,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:14,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:14,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393601767] [2023-03-31 01:28:14,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:14,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:14,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:14,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:14,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:14,503 INFO L87 Difference]: Start difference. First operand 687 states and 922 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 12 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-03-31 01:28:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:16,090 INFO L93 Difference]: Finished difference Result 1268 states and 1725 transitions. [2023-03-31 01:28:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:16,090 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 12 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-03-31 01:28:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:16,094 INFO L225 Difference]: With dead ends: 1268 [2023-03-31 01:28:16,094 INFO L226 Difference]: Without dead ends: 705 [2023-03-31 01:28:16,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:16,097 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1326 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:16,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 109 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 01:28:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-03-31 01:28:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2023-03-31 01:28:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 500 states have (on average 1.358) internal successors, (679), 508 states have internal predecessors, (679), 126 states have call successors, (126), 75 states have call predecessors, (126), 78 states have return successors, (132), 121 states have call predecessors, (132), 125 states have call successors, (132) [2023-03-31 01:28:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 937 transitions. [2023-03-31 01:28:16,257 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 937 transitions. Word has length 117 [2023-03-31 01:28:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:16,257 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 937 transitions. [2023-03-31 01:28:16,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 12 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-03-31 01:28:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 937 transitions. [2023-03-31 01:28:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-03-31 01:28:16,260 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:16,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 01:28:16,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-03-31 01:28:16,260 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:16,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1408347336, now seen corresponding path program 1 times [2023-03-31 01:28:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647474201] [2023-03-31 01:28:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-03-31 01:28:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-03-31 01:28:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-03-31 01:28:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-03-31 01:28:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-03-31 01:28:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-03-31 01:28:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-03-31 01:28:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:16,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647474201] [2023-03-31 01:28:16,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647474201] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:16,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:16,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-03-31 01:28:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290396569] [2023-03-31 01:28:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:16,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-03-31 01:28:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:16,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-03-31 01:28:16,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-03-31 01:28:16,908 INFO L87 Difference]: Start difference. First operand 705 states and 937 transitions. Second operand has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (20), 11 states have call predecessors, (20), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2023-03-31 01:28:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:21,480 INFO L93 Difference]: Finished difference Result 1904 states and 2509 transitions. [2023-03-31 01:28:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-03-31 01:28:21,481 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (20), 11 states have call predecessors, (20), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) Word has length 122 [2023-03-31 01:28:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:21,485 INFO L225 Difference]: With dead ends: 1904 [2023-03-31 01:28:21,486 INFO L226 Difference]: Without dead ends: 1308 [2023-03-31 01:28:21,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2023-03-31 01:28:21,488 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2436 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 3117 mSolverCounterSat, 873 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2450 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 3990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 3117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:21,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2450 Valid, 182 Invalid, 3990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [873 Valid, 3117 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-03-31 01:28:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2023-03-31 01:28:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1253. [2023-03-31 01:28:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 901 states have (on average 1.3318534961154274) internal successors, (1200), 912 states have internal predecessors, (1200), 207 states have call successors, (207), 135 states have call predecessors, (207), 144 states have return successors, (219), 205 states have call predecessors, (219), 206 states have call successors, (219) [2023-03-31 01:28:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1626 transitions. [2023-03-31 01:28:21,761 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1626 transitions. Word has length 122 [2023-03-31 01:28:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:21,762 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 1626 transitions. [2023-03-31 01:28:21,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (20), 11 states have call predecessors, (20), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2023-03-31 01:28:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1626 transitions. [2023-03-31 01:28:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-03-31 01:28:21,763 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:21,764 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:28:21,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-03-31 01:28:21,764 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:21,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1138439153, now seen corresponding path program 1 times [2023-03-31 01:28:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:21,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83002056] [2023-03-31 01:28:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:21,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:28:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-03-31 01:28:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-03-31 01:28:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-03-31 01:28:22,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:22,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83002056] [2023-03-31 01:28:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83002056] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:22,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:22,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-03-31 01:28:22,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232764086] [2023-03-31 01:28:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:22,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 01:28:22,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:22,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 01:28:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-03-31 01:28:22,178 INFO L87 Difference]: Start difference. First operand 1253 states and 1626 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (21), 12 states have call predecessors, (21), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-03-31 01:28:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 01:28:23,869 INFO L93 Difference]: Finished difference Result 2275 states and 2978 transitions. [2023-03-31 01:28:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 01:28:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (21), 12 states have call predecessors, (21), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 124 [2023-03-31 01:28:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 01:28:23,874 INFO L225 Difference]: With dead ends: 2275 [2023-03-31 01:28:23,874 INFO L226 Difference]: Without dead ends: 1265 [2023-03-31 01:28:23,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-03-31 01:28:23,878 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 982 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-03-31 01:28:23,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 115 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-03-31 01:28:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2023-03-31 01:28:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1253. [2023-03-31 01:28:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 902 states have (on average 1.319290465631929) internal successors, (1190), 913 states have internal predecessors, (1190), 202 states have call successors, (202), 139 states have call predecessors, (202), 148 states have return successors, (214), 200 states have call predecessors, (214), 201 states have call successors, (214) [2023-03-31 01:28:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1606 transitions. [2023-03-31 01:28:24,150 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1606 transitions. Word has length 124 [2023-03-31 01:28:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 01:28:24,151 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 1606 transitions. [2023-03-31 01:28:24,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (21), 12 states have call predecessors, (21), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-03-31 01:28:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1606 transitions. [2023-03-31 01:28:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-03-31 01:28:24,153 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 01:28:24,153 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-31 01:28:24,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-03-31 01:28:24,160 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 01:28:24,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 01:28:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1222932772, now seen corresponding path program 1 times [2023-03-31 01:28:24,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 01:28:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630141805] [2023-03-31 01:28:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 01:28:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 01:28:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 01:28:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-03-31 01:28:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-03-31 01:28:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-03-31 01:28:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-03-31 01:28:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-03-31 01:28:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-03-31 01:28:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-03-31 01:28:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-03-31 01:28:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-03-31 01:28:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-03-31 01:28:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-03-31 01:28:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-03-31 01:28:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-03-31 01:28:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 01:28:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-03-31 01:28:24,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 01:28:24,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630141805] [2023-03-31 01:28:24,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630141805] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 01:28:24,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 01:28:24,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-03-31 01:28:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835288779] [2023-03-31 01:28:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 01:28:24,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-31 01:28:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 01:28:24,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-31 01:28:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-03-31 01:28:24,644 INFO L87 Difference]: Start difference. First operand 1253 states and 1606 transitions. Second operand has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 8 states have internal predecessors, (80), 5 states have call successors, (21), 12 states have call predecessors, (21), 4 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17)