/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:09:03,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:09:03,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:09:03,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:09:03,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:09:03,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:09:03,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:09:03,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:09:03,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:09:03,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:09:03,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:09:03,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:09:03,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:09:03,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:09:03,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:09:03,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:09:03,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:09:03,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:09:03,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:09:03,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:09:03,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:09:03,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:09:03,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:09:03,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:09:03,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:09:03,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:09:03,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:09:03,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:09:03,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:09:03,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:09:03,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:09:03,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:09:03,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:09:03,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:09:03,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:09:03,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:09:03,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:09:03,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:09:03,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:09:03,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:09:03,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:09:03,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:09:03,763 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:09:03,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:09:03,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:09:03,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:09:03,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:09:03,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:09:03,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:09:03,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:09:03,765 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:09:03,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:09:03,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:09:03,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:09:03,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:09:03,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:09:03,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:09:03,766 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:09:03,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:09:03,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:09:03,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:09:03,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:09:03,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:09:03,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:09:03,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:09:03,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:09:03,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:09:03,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:09:03,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:09:03,767 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:09:03,768 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:09:03,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:09:03,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:09:03,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:09:03,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:09:03,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:09:03,958 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:09:03,958 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:09:03,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2022-01-10 01:09:04,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2991756/64887d0d4faf42369a0c59a93079f67c/FLAG5bf8e386e [2022-01-10 01:09:04,398 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:09:04,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2022-01-10 01:09:04,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2991756/64887d0d4faf42369a0c59a93079f67c/FLAG5bf8e386e [2022-01-10 01:09:04,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2991756/64887d0d4faf42369a0c59a93079f67c [2022-01-10 01:09:04,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:09:04,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:09:04,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:09:04,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:09:04,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:09:04,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50433874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04, skipping insertion in model container [2022-01-10 01:09:04,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:09:04,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:09:04,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2022-01-10 01:09:04,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:09:04,689 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:09:04,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2022-01-10 01:09:04,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:09:04,742 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:09:04,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04 WrapperNode [2022-01-10 01:09:04,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:09:04,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:09:04,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:09:04,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:09:04,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,791 INFO L137 Inliner]: procedures = 32, calls = 47, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 539 [2022-01-10 01:09:04,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:09:04,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:09:04,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:09:04,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:09:04,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:09:04,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:09:04,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:09:04,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:09:04,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2022-01-10 01:09:04,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:09:04,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:04,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 01:09:04,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 01:09:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-01-10 01:09:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-01-10 01:09:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:09:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-01-10 01:09:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-01-10 01:09:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-01-10 01:09:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-01-10 01:09:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 01:09:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 01:09:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:09:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-01-10 01:09:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-01-10 01:09:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:09:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:09:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-01-10 01:09:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-01-10 01:09:05,034 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:09:05,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:09:05,465 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:09:05,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:09:05,471 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 01:09:05,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:05 BoogieIcfgContainer [2022-01-10 01:09:05,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:09:05,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:09:05,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:09:05,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:09:05,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:09:04" (1/3) ... [2022-01-10 01:09:05,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:05, skipping insertion in model container [2022-01-10 01:09:05,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (2/3) ... [2022-01-10 01:09:05,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:05, skipping insertion in model container [2022-01-10 01:09:05,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:05" (3/3) ... [2022-01-10 01:09:05,478 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2022-01-10 01:09:05,482 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:09:05,482 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:09:05,512 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:09:05,516 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 01:09:05,516 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:09:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 163 states have (on average 1.5582822085889572) internal successors, (254), 164 states have internal predecessors, (254), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-10 01:09:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 01:09:05,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:05,536 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:05,537 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1020756392, now seen corresponding path program 1 times [2022-01-10 01:09:05,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:05,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888569523] [2022-01-10 01:09:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:05,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:05,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:09:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:09:05,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:05,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888569523] [2022-01-10 01:09:05,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888569523] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:05,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:05,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 01:09:05,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878889468] [2022-01-10 01:09:05,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:05,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 01:09:05,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 01:09:05,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:09:05,725 INFO L87 Difference]: Start difference. First operand has 200 states, 163 states have (on average 1.5582822085889572) internal successors, (254), 164 states have internal predecessors, (254), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:05,783 INFO L93 Difference]: Finished difference Result 384 states and 624 transitions. [2022-01-10 01:09:05,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 01:09:05,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-10 01:09:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:05,800 INFO L225 Difference]: With dead ends: 384 [2022-01-10 01:09:05,800 INFO L226 Difference]: Without dead ends: 196 [2022-01-10 01:09:05,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:09:05,811 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:05,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-01-10 01:09:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-01-10 01:09:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.50625) internal successors, (241), 160 states have internal predecessors, (241), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-10 01:09:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 299 transitions. [2022-01-10 01:09:05,881 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 299 transitions. Word has length 44 [2022-01-10 01:09:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:05,882 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 299 transitions. [2022-01-10 01:09:05,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 299 transitions. [2022-01-10 01:09:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 01:09:05,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:05,885 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:05,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:09:05,886 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:05,888 INFO L85 PathProgramCache]: Analyzing trace with hash 589289062, now seen corresponding path program 1 times [2022-01-10 01:09:05,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:05,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134540858] [2022-01-10 01:09:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:05,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:09:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:09:06,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:06,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134540858] [2022-01-10 01:09:06,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134540858] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:06,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:06,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 01:09:06,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999896718] [2022-01-10 01:09:06,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:06,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:09:06,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:06,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:09:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:09:06,048 INFO L87 Difference]: Start difference. First operand 196 states and 299 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:06,143 INFO L93 Difference]: Finished difference Result 515 states and 789 transitions. [2022-01-10 01:09:06,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 01:09:06,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-10 01:09:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:06,146 INFO L225 Difference]: With dead ends: 515 [2022-01-10 01:09:06,146 INFO L226 Difference]: Without dead ends: 333 [2022-01-10 01:09:06,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:06,147 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 171 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:06,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 1533 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-01-10 01:09:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 196. [2022-01-10 01:09:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.43125) internal successors, (229), 160 states have internal predecessors, (229), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-10 01:09:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 287 transitions. [2022-01-10 01:09:06,162 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 287 transitions. Word has length 44 [2022-01-10 01:09:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:06,162 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 287 transitions. [2022-01-10 01:09:06,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 287 transitions. [2022-01-10 01:09:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 01:09:06,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:06,164 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:06,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:09:06,164 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 256458786, now seen corresponding path program 1 times [2022-01-10 01:09:06,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:06,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401500626] [2022-01-10 01:09:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:06,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:09:06,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:06,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401500626] [2022-01-10 01:09:06,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401500626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:06,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:06,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:06,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516375170] [2022-01-10 01:09:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:06,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:06,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:06,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:06,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:06,324 INFO L87 Difference]: Start difference. First operand 196 states and 287 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:06,356 INFO L93 Difference]: Finished difference Result 379 states and 564 transitions. [2022-01-10 01:09:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:06,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-01-10 01:09:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:06,358 INFO L225 Difference]: With dead ends: 379 [2022-01-10 01:09:06,358 INFO L226 Difference]: Without dead ends: 200 [2022-01-10 01:09:06,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:06,360 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 5 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:06,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 833 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-01-10 01:09:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-01-10 01:09:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 163 states have (on average 1.4233128834355828) internal successors, (232), 163 states have internal predecessors, (232), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-10 01:09:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 290 transitions. [2022-01-10 01:09:06,370 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 290 transitions. Word has length 55 [2022-01-10 01:09:06,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:06,370 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 290 transitions. [2022-01-10 01:09:06,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 290 transitions. [2022-01-10 01:09:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 01:09:06,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:06,372 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:06,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 01:09:06,372 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:06,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1571313168, now seen corresponding path program 1 times [2022-01-10 01:09:06,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:06,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281768211] [2022-01-10 01:09:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:06,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-10 01:09:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:06,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:06,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281768211] [2022-01-10 01:09:06,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281768211] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:06,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:06,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:09:06,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228989860] [2022-01-10 01:09:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:06,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:09:06,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:09:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:06,444 INFO L87 Difference]: Start difference. First operand 200 states and 290 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:06,470 INFO L93 Difference]: Finished difference Result 546 states and 804 transitions. [2022-01-10 01:09:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:09:06,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2022-01-10 01:09:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:06,473 INFO L225 Difference]: With dead ends: 546 [2022-01-10 01:09:06,473 INFO L226 Difference]: Without dead ends: 363 [2022-01-10 01:09:06,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:06,475 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 223 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:06,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 599 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-01-10 01:09:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 353. [2022-01-10 01:09:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 281 states have (on average 1.4448398576512456) internal successors, (406), 282 states have internal predecessors, (406), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-01-10 01:09:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 520 transitions. [2022-01-10 01:09:06,501 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 520 transitions. Word has length 71 [2022-01-10 01:09:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:06,501 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 520 transitions. [2022-01-10 01:09:06,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 520 transitions. [2022-01-10 01:09:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 01:09:06,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:06,502 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:06,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 01:09:06,503 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:06,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:06,503 INFO L85 PathProgramCache]: Analyzing trace with hash 348885538, now seen corresponding path program 1 times [2022-01-10 01:09:06,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:06,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75346957] [2022-01-10 01:09:06,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:06,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 01:09:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:06,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:06,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75346957] [2022-01-10 01:09:06,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75346957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:06,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:06,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:06,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780672205] [2022-01-10 01:09:06,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:06,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:06,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:06,585 INFO L87 Difference]: Start difference. First operand 353 states and 520 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:06,830 INFO L93 Difference]: Finished difference Result 1015 states and 1522 transitions. [2022-01-10 01:09:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:09:06,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2022-01-10 01:09:06,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:06,839 INFO L225 Difference]: With dead ends: 1015 [2022-01-10 01:09:06,839 INFO L226 Difference]: Without dead ends: 679 [2022-01-10 01:09:06,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:06,847 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 764 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:06,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [764 Valid, 743 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:09:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-01-10 01:09:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 447. [2022-01-10 01:09:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 371 states have (on average 1.431266846361186) internal successors, (531), 372 states have internal predecessors, (531), 59 states have call successors, (59), 16 states have call predecessors, (59), 16 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 649 transitions. [2022-01-10 01:09:06,906 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 649 transitions. Word has length 72 [2022-01-10 01:09:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:06,907 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 649 transitions. [2022-01-10 01:09:06,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 649 transitions. [2022-01-10 01:09:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 01:09:06,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:06,911 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:06,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 01:09:06,911 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1827557999, now seen corresponding path program 1 times [2022-01-10 01:09:06,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073015357] [2022-01-10 01:09:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:06,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-10 01:09:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:07,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:07,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073015357] [2022-01-10 01:09:07,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073015357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:07,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:07,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:07,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513574545] [2022-01-10 01:09:07,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:07,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:07,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:07,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:07,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:07,028 INFO L87 Difference]: Start difference. First operand 447 states and 649 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:07,281 INFO L93 Difference]: Finished difference Result 1017 states and 1522 transitions. [2022-01-10 01:09:07,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:09:07,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 73 [2022-01-10 01:09:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:07,286 INFO L225 Difference]: With dead ends: 1017 [2022-01-10 01:09:07,286 INFO L226 Difference]: Without dead ends: 681 [2022-01-10 01:09:07,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:07,289 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 761 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:07,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 745 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:09:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-01-10 01:09:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 451. [2022-01-10 01:09:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 375 states have (on average 1.4266666666666667) internal successors, (535), 376 states have internal predecessors, (535), 59 states have call successors, (59), 16 states have call predecessors, (59), 16 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 653 transitions. [2022-01-10 01:09:07,331 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 653 transitions. Word has length 73 [2022-01-10 01:09:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:07,332 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 653 transitions. [2022-01-10 01:09:07,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 653 transitions. [2022-01-10 01:09:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 01:09:07,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:07,334 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:07,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 01:09:07,334 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash -47235395, now seen corresponding path program 1 times [2022-01-10 01:09:07,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:07,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928463320] [2022-01-10 01:09:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:07,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-10 01:09:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:07,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:07,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928463320] [2022-01-10 01:09:07,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928463320] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:07,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:07,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:07,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122152966] [2022-01-10 01:09:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:07,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:07,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:07,441 INFO L87 Difference]: Start difference. First operand 451 states and 653 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:07,654 INFO L93 Difference]: Finished difference Result 1017 states and 1518 transitions. [2022-01-10 01:09:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:07,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 75 [2022-01-10 01:09:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:07,659 INFO L225 Difference]: With dead ends: 1017 [2022-01-10 01:09:07,660 INFO L226 Difference]: Without dead ends: 681 [2022-01-10 01:09:07,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:07,663 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 228 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:07,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 718 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:09:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-01-10 01:09:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 451. [2022-01-10 01:09:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 375 states have (on average 1.4213333333333333) internal successors, (533), 376 states have internal predecessors, (533), 59 states have call successors, (59), 16 states have call predecessors, (59), 16 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 651 transitions. [2022-01-10 01:09:07,696 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 651 transitions. Word has length 75 [2022-01-10 01:09:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:07,697 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 651 transitions. [2022-01-10 01:09:07,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 651 transitions. [2022-01-10 01:09:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-10 01:09:07,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:07,699 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:07,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 01:09:07,699 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:07,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:07,700 INFO L85 PathProgramCache]: Analyzing trace with hash 827473940, now seen corresponding path program 1 times [2022-01-10 01:09:07,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:07,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449237184] [2022-01-10 01:09:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:07,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:07,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:07,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449237184] [2022-01-10 01:09:07,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449237184] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:07,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:07,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:07,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298538061] [2022-01-10 01:09:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:07,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:07,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:07,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:07,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:07,808 INFO L87 Difference]: Start difference. First operand 451 states and 651 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 01:09:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:07,843 INFO L93 Difference]: Finished difference Result 797 states and 1167 transitions. [2022-01-10 01:09:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:07,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2022-01-10 01:09:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:07,846 INFO L225 Difference]: With dead ends: 797 [2022-01-10 01:09:07,846 INFO L226 Difference]: Without dead ends: 461 [2022-01-10 01:09:07,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:07,847 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 6 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:07,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 845 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-01-10 01:09:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2022-01-10 01:09:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 383 states have (on average 1.412532637075718) internal successors, (541), 384 states have internal predecessors, (541), 59 states have call successors, (59), 18 states have call predecessors, (59), 18 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 659 transitions. [2022-01-10 01:09:07,872 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 659 transitions. Word has length 76 [2022-01-10 01:09:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:07,872 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 659 transitions. [2022-01-10 01:09:07,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 01:09:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 659 transitions. [2022-01-10 01:09:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 01:09:07,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:07,873 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:07,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 01:09:07,874 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:07,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash 193576026, now seen corresponding path program 1 times [2022-01-10 01:09:07,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:07,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57430925] [2022-01-10 01:09:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:07,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:07,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:07,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57430925] [2022-01-10 01:09:07,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57430925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:07,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:07,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:07,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810391302] [2022-01-10 01:09:07,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:07,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:07,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:07,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:07,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:07,955 INFO L87 Difference]: Start difference. First operand 461 states and 659 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 01:09:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:08,002 INFO L93 Difference]: Finished difference Result 817 states and 1189 transitions. [2022-01-10 01:09:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:08,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 84 [2022-01-10 01:09:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:08,004 INFO L225 Difference]: With dead ends: 817 [2022-01-10 01:09:08,004 INFO L226 Difference]: Without dead ends: 471 [2022-01-10 01:09:08,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:08,007 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 6 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:08,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 831 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-01-10 01:09:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2022-01-10 01:09:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 391 states have (on average 1.4040920716112533) internal successors, (549), 392 states have internal predecessors, (549), 59 states have call successors, (59), 20 states have call predecessors, (59), 20 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 667 transitions. [2022-01-10 01:09:08,032 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 667 transitions. Word has length 84 [2022-01-10 01:09:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:08,032 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 667 transitions. [2022-01-10 01:09:08,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 01:09:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 667 transitions. [2022-01-10 01:09:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 01:09:08,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:08,035 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:08,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 01:09:08,035 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash 910678340, now seen corresponding path program 1 times [2022-01-10 01:09:08,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:08,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65421410] [2022-01-10 01:09:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:08,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:08,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65421410] [2022-01-10 01:09:08,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65421410] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:08,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:08,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:08,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218624805] [2022-01-10 01:09:08,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:08,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:08,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:08,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:08,123 INFO L87 Difference]: Start difference. First operand 471 states and 667 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 01:09:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:08,161 INFO L93 Difference]: Finished difference Result 835 states and 1197 transitions. [2022-01-10 01:09:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:08,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2022-01-10 01:09:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:08,163 INFO L225 Difference]: With dead ends: 835 [2022-01-10 01:09:08,163 INFO L226 Difference]: Without dead ends: 479 [2022-01-10 01:09:08,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:08,165 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 5 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:08,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 840 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-01-10 01:09:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2022-01-10 01:09:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 397 states have (on average 1.397984886649874) internal successors, (555), 398 states have internal predecessors, (555), 59 states have call successors, (59), 22 states have call predecessors, (59), 22 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 673 transitions. [2022-01-10 01:09:08,188 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 673 transitions. Word has length 92 [2022-01-10 01:09:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:08,188 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 673 transitions. [2022-01-10 01:09:08,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 01:09:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 673 transitions. [2022-01-10 01:09:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 01:09:08,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:08,190 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:08,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 01:09:08,191 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:08,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash -987829653, now seen corresponding path program 1 times [2022-01-10 01:09:08,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:08,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989658867] [2022-01-10 01:09:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:08,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:08,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:08,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989658867] [2022-01-10 01:09:08,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989658867] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:08,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:08,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:08,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069465027] [2022-01-10 01:09:08,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:08,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:08,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:08,263 INFO L87 Difference]: Start difference. First operand 479 states and 673 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 01:09:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:08,310 INFO L93 Difference]: Finished difference Result 853 states and 1217 transitions. [2022-01-10 01:09:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2022-01-10 01:09:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:08,313 INFO L225 Difference]: With dead ends: 853 [2022-01-10 01:09:08,313 INFO L226 Difference]: Without dead ends: 489 [2022-01-10 01:09:08,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:08,314 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 6 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:08,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 831 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-01-10 01:09:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2022-01-10 01:09:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 405 states have (on average 1.3901234567901235) internal successors, (563), 406 states have internal predecessors, (563), 59 states have call successors, (59), 24 states have call predecessors, (59), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 681 transitions. [2022-01-10 01:09:08,335 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 681 transitions. Word has length 92 [2022-01-10 01:09:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:08,335 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 681 transitions. [2022-01-10 01:09:08,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 01:09:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 681 transitions. [2022-01-10 01:09:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-10 01:09:08,336 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:08,336 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:08,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 01:09:08,336 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:08,337 INFO L85 PathProgramCache]: Analyzing trace with hash -551537553, now seen corresponding path program 1 times [2022-01-10 01:09:08,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:08,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354393273] [2022-01-10 01:09:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:08,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 01:09:08,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:08,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354393273] [2022-01-10 01:09:08,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354393273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:08,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:08,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:08,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249505215] [2022-01-10 01:09:08,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:08,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:08,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:08,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:08,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:08,414 INFO L87 Difference]: Start difference. First operand 489 states and 681 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 01:09:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:08,458 INFO L93 Difference]: Finished difference Result 875 states and 1231 transitions. [2022-01-10 01:09:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 100 [2022-01-10 01:09:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:08,460 INFO L225 Difference]: With dead ends: 875 [2022-01-10 01:09:08,460 INFO L226 Difference]: Without dead ends: 501 [2022-01-10 01:09:08,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:08,461 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 7 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:08,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 842 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-01-10 01:09:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-01-10 01:09:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 415 states have (on average 1.380722891566265) internal successors, (573), 416 states have internal predecessors, (573), 59 states have call successors, (59), 26 states have call predecessors, (59), 26 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 691 transitions. [2022-01-10 01:09:08,483 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 691 transitions. Word has length 100 [2022-01-10 01:09:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:08,484 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 691 transitions. [2022-01-10 01:09:08,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 01:09:08,484 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 691 transitions. [2022-01-10 01:09:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 01:09:08,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:08,485 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:08,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 01:09:08,485 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:08,486 INFO L85 PathProgramCache]: Analyzing trace with hash -397643204, now seen corresponding path program 1 times [2022-01-10 01:09:08,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:08,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567304062] [2022-01-10 01:09:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:08,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 01:09:08,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:08,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567304062] [2022-01-10 01:09:08,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567304062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:08,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:08,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:08,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602536524] [2022-01-10 01:09:08,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:08,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:08,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:08,636 INFO L87 Difference]: Start difference. First operand 501 states and 691 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 01:09:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:08,837 INFO L93 Difference]: Finished difference Result 1365 states and 1906 transitions. [2022-01-10 01:09:08,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:09:08,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 103 [2022-01-10 01:09:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:08,841 INFO L225 Difference]: With dead ends: 1365 [2022-01-10 01:09:08,841 INFO L226 Difference]: Without dead ends: 979 [2022-01-10 01:09:08,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:09:08,842 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 386 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:08,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 2219 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2022-01-10 01:09:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 645. [2022-01-10 01:09:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 522 states have (on average 1.371647509578544) internal successors, (716), 524 states have internal predecessors, (716), 83 states have call successors, (83), 39 states have call predecessors, (83), 39 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2022-01-10 01:09:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 882 transitions. [2022-01-10 01:09:08,875 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 882 transitions. Word has length 103 [2022-01-10 01:09:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:08,876 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 882 transitions. [2022-01-10 01:09:08,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 01:09:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 882 transitions. [2022-01-10 01:09:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 01:09:08,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:08,877 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:08,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 01:09:08,877 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:08,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2035814869, now seen corresponding path program 1 times [2022-01-10 01:09:08,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:08,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072285309] [2022-01-10 01:09:08,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:08,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 01:09:08,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:08,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072285309] [2022-01-10 01:09:08,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072285309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:08,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:08,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:08,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591406243] [2022-01-10 01:09:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:08,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:08,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:08,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:08,937 INFO L87 Difference]: Start difference. First operand 645 states and 882 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 01:09:08,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:08,984 INFO L93 Difference]: Finished difference Result 1151 states and 1587 transitions. [2022-01-10 01:09:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 107 [2022-01-10 01:09:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:08,987 INFO L225 Difference]: With dead ends: 1151 [2022-01-10 01:09:08,987 INFO L226 Difference]: Without dead ends: 657 [2022-01-10 01:09:08,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:08,988 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 5 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:08,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 840 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-01-10 01:09:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2022-01-10 01:09:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 533 states have internal predecessors, (725), 83 states have call successors, (83), 42 states have call predecessors, (83), 42 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2022-01-10 01:09:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 891 transitions. [2022-01-10 01:09:09,020 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 891 transitions. Word has length 107 [2022-01-10 01:09:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:09,020 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 891 transitions. [2022-01-10 01:09:09,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 01:09:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 891 transitions. [2022-01-10 01:09:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 01:09:09,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:09,021 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 01:09:09,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 01:09:09,021 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash -533964092, now seen corresponding path program 1 times [2022-01-10 01:09:09,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:09,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963200645] [2022-01-10 01:09:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:09,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 01:09:09,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:09,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963200645] [2022-01-10 01:09:09,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963200645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:09,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:09,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 01:09:09,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774511666] [2022-01-10 01:09:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:09,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:09:09,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:09,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:09:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:09:09,094 INFO L87 Difference]: Start difference. First operand 657 states and 891 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 01:09:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:09,180 INFO L93 Difference]: Finished difference Result 923 states and 1304 transitions. [2022-01-10 01:09:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 01:09:09,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 106 [2022-01-10 01:09:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:09,185 INFO L225 Difference]: With dead ends: 923 [2022-01-10 01:09:09,185 INFO L226 Difference]: Without dead ends: 921 [2022-01-10 01:09:09,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:09,186 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 263 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:09,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 2202 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-01-10 01:09:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 661. [2022-01-10 01:09:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 533 states have (on average 1.3639774859287055) internal successors, (727), 536 states have internal predecessors, (727), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-01-10 01:09:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 895 transitions. [2022-01-10 01:09:09,224 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 895 transitions. Word has length 106 [2022-01-10 01:09:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:09,224 INFO L470 AbstractCegarLoop]: Abstraction has 661 states and 895 transitions. [2022-01-10 01:09:09,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 01:09:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 895 transitions. [2022-01-10 01:09:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 01:09:09,225 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:09,225 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:09,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 01:09:09,226 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1482497308, now seen corresponding path program 1 times [2022-01-10 01:09:09,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:09,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029659787] [2022-01-10 01:09:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:09,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 01:09:09,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:09,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029659787] [2022-01-10 01:09:09,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029659787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:09,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:09,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:09,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772687581] [2022-01-10 01:09:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:09,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:09,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:09,295 INFO L87 Difference]: Start difference. First operand 661 states and 895 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:09:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:09,451 INFO L93 Difference]: Finished difference Result 1393 states and 1918 transitions. [2022-01-10 01:09:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:09:09,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 109 [2022-01-10 01:09:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:09,455 INFO L225 Difference]: With dead ends: 1393 [2022-01-10 01:09:09,456 INFO L226 Difference]: Without dead ends: 924 [2022-01-10 01:09:09,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:09:09,457 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 506 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:09,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 2189 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-01-10 01:09:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 705. [2022-01-10 01:09:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 586 states have (on average 1.3583617747440273) internal successors, (796), 591 states have internal predecessors, (796), 76 states have call successors, (76), 42 states have call predecessors, (76), 42 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2022-01-10 01:09:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 948 transitions. [2022-01-10 01:09:09,506 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 948 transitions. Word has length 109 [2022-01-10 01:09:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:09,506 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 948 transitions. [2022-01-10 01:09:09,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:09:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 948 transitions. [2022-01-10 01:09:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 01:09:09,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:09,507 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 01:09:09,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 01:09:09,508 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash -845820830, now seen corresponding path program 1 times [2022-01-10 01:09:09,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:09,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640290221] [2022-01-10 01:09:09,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:09,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 01:09:09,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:09,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640290221] [2022-01-10 01:09:09,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640290221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:09,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:09,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:09,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939676819] [2022-01-10 01:09:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:09,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:09,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:09,600 INFO L87 Difference]: Start difference. First operand 705 states and 948 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:09:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:09,746 INFO L93 Difference]: Finished difference Result 1456 states and 2000 transitions. [2022-01-10 01:09:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:09:09,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 111 [2022-01-10 01:09:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:09,750 INFO L225 Difference]: With dead ends: 1456 [2022-01-10 01:09:09,750 INFO L226 Difference]: Without dead ends: 933 [2022-01-10 01:09:09,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:09:09,752 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 370 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:09,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 2341 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2022-01-10 01:09:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 694. [2022-01-10 01:09:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 578 states have (on average 1.356401384083045) internal successors, (784), 583 states have internal predecessors, (784), 74 states have call successors, (74), 41 states have call predecessors, (74), 41 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2022-01-10 01:09:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 932 transitions. [2022-01-10 01:09:09,793 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 932 transitions. Word has length 111 [2022-01-10 01:09:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:09,794 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 932 transitions. [2022-01-10 01:09:09,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:09:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 932 transitions. [2022-01-10 01:09:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:09:09,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:09,795 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:09,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 01:09:09,795 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1253142038, now seen corresponding path program 1 times [2022-01-10 01:09:09,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:09,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482368165] [2022-01-10 01:09:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:09,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:09,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:09,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482368165] [2022-01-10 01:09:09,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482368165] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:09,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:09,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:09,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438377057] [2022-01-10 01:09:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:09,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:09,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:09,856 INFO L87 Difference]: Start difference. First operand 694 states and 932 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:10,037 INFO L93 Difference]: Finished difference Result 1930 states and 2641 transitions. [2022-01-10 01:09:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2022-01-10 01:09:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:10,042 INFO L225 Difference]: With dead ends: 1930 [2022-01-10 01:09:10,042 INFO L226 Difference]: Without dead ends: 1398 [2022-01-10 01:09:10,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:10,044 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 436 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:10,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 1039 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2022-01-10 01:09:10,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1156. [2022-01-10 01:09:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 940 states have (on average 1.348936170212766) internal successors, (1268), 949 states have internal predecessors, (1268), 140 states have call successors, (140), 75 states have call predecessors, (140), 75 states have return successors, (140), 131 states have call predecessors, (140), 140 states have call successors, (140) [2022-01-10 01:09:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1548 transitions. [2022-01-10 01:09:10,108 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1548 transitions. Word has length 112 [2022-01-10 01:09:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:10,109 INFO L470 AbstractCegarLoop]: Abstraction has 1156 states and 1548 transitions. [2022-01-10 01:09:10,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1548 transitions. [2022-01-10 01:09:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:09:10,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:10,110 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:10,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 01:09:10,110 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:10,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:10,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1507667202, now seen corresponding path program 1 times [2022-01-10 01:09:10,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:10,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469977631] [2022-01-10 01:09:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:10,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:10,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:10,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469977631] [2022-01-10 01:09:10,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469977631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:10,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:10,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:09:10,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942468898] [2022-01-10 01:09:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:10,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:09:10,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:10,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:09:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:10,157 INFO L87 Difference]: Start difference. First operand 1156 states and 1548 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:09:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:10,262 INFO L93 Difference]: Finished difference Result 3030 states and 4042 transitions. [2022-01-10 01:09:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:09:10,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 112 [2022-01-10 01:09:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:10,269 INFO L225 Difference]: With dead ends: 3030 [2022-01-10 01:09:10,270 INFO L226 Difference]: Without dead ends: 2049 [2022-01-10 01:09:10,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:10,272 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 221 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:10,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 629 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2022-01-10 01:09:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1693. [2022-01-10 01:09:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1342 states have (on average 1.342026825633383) internal successors, (1801), 1357 states have internal predecessors, (1801), 230 states have call successors, (230), 120 states have call predecessors, (230), 120 states have return successors, (230), 215 states have call predecessors, (230), 230 states have call successors, (230) [2022-01-10 01:09:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2261 transitions. [2022-01-10 01:09:10,411 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2261 transitions. Word has length 112 [2022-01-10 01:09:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:10,412 INFO L470 AbstractCegarLoop]: Abstraction has 1693 states and 2261 transitions. [2022-01-10 01:09:10,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:09:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2261 transitions. [2022-01-10 01:09:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:09:10,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:10,413 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:10,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 01:09:10,413 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -520918908, now seen corresponding path program 1 times [2022-01-10 01:09:10,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:10,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184452316] [2022-01-10 01:09:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:10,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 01:09:10,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:10,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184452316] [2022-01-10 01:09:10,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184452316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:10,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:10,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:09:10,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614952058] [2022-01-10 01:09:10,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:10,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 01:09:10,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:10,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 01:09:10,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:10,503 INFO L87 Difference]: Start difference. First operand 1693 states and 2261 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 01:09:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:11,052 INFO L93 Difference]: Finished difference Result 3923 states and 5386 transitions. [2022-01-10 01:09:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 01:09:11,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 112 [2022-01-10 01:09:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:11,061 INFO L225 Difference]: With dead ends: 3923 [2022-01-10 01:09:11,061 INFO L226 Difference]: Without dead ends: 2501 [2022-01-10 01:09:11,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:09:11,066 INFO L933 BasicCegarLoop]: 671 mSDtfsCounter, 902 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:11,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [908 Valid, 2711 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:09:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2022-01-10 01:09:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 1699. [2022-01-10 01:09:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1342 states have (on average 1.3286140089418779) internal successors, (1783), 1358 states have internal predecessors, (1783), 231 states have call successors, (231), 125 states have call predecessors, (231), 125 states have return successors, (231), 215 states have call predecessors, (231), 231 states have call successors, (231) [2022-01-10 01:09:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2245 transitions. [2022-01-10 01:09:11,294 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2245 transitions. Word has length 112 [2022-01-10 01:09:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:11,294 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 2245 transitions. [2022-01-10 01:09:11,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 01:09:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2245 transitions. [2022-01-10 01:09:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-10 01:09:11,296 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:11,296 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:11,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 01:09:11,296 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:11,296 INFO L85 PathProgramCache]: Analyzing trace with hash -851800033, now seen corresponding path program 1 times [2022-01-10 01:09:11,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:11,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692704531] [2022-01-10 01:09:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:11,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 01:09:11,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:11,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692704531] [2022-01-10 01:09:11,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692704531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:11,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:11,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:11,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442791018] [2022-01-10 01:09:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:11,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:11,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:11,386 INFO L87 Difference]: Start difference. First operand 1699 states and 2245 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:11,983 INFO L93 Difference]: Finished difference Result 4059 states and 5487 transitions. [2022-01-10 01:09:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 01:09:11,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 114 [2022-01-10 01:09:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:11,993 INFO L225 Difference]: With dead ends: 4059 [2022-01-10 01:09:11,993 INFO L226 Difference]: Without dead ends: 2689 [2022-01-10 01:09:11,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:09:11,997 INFO L933 BasicCegarLoop]: 547 mSDtfsCounter, 784 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:11,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [787 Valid, 2377 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:09:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2022-01-10 01:09:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 1718. [2022-01-10 01:09:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1348 states have (on average 1.3241839762611276) internal successors, (1785), 1365 states have internal predecessors, (1785), 239 states have call successors, (239), 130 states have call predecessors, (239), 130 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) [2022-01-10 01:09:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2263 transitions. [2022-01-10 01:09:12,156 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2263 transitions. Word has length 114 [2022-01-10 01:09:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:12,157 INFO L470 AbstractCegarLoop]: Abstraction has 1718 states and 2263 transitions. [2022-01-10 01:09:12,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2263 transitions. [2022-01-10 01:09:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-10 01:09:12,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:12,159 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:12,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 01:09:12,159 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1202474879, now seen corresponding path program 1 times [2022-01-10 01:09:12,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:12,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545590888] [2022-01-10 01:09:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:12,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 01:09:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:12,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:12,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545590888] [2022-01-10 01:09:12,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545590888] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:12,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:12,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:12,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656474265] [2022-01-10 01:09:12,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:12,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:12,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:12,222 INFO L87 Difference]: Start difference. First operand 1718 states and 2263 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:12,560 INFO L93 Difference]: Finished difference Result 4482 states and 5976 transitions. [2022-01-10 01:09:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:12,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-01-10 01:09:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:12,571 INFO L225 Difference]: With dead ends: 4482 [2022-01-10 01:09:12,571 INFO L226 Difference]: Without dead ends: 3128 [2022-01-10 01:09:12,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:12,575 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 471 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:12,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 1246 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2022-01-10 01:09:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2647. [2022-01-10 01:09:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 2040 states have (on average 1.3205882352941176) internal successors, (2694), 2067 states have internal predecessors, (2694), 394 states have call successors, (394), 212 states have call predecessors, (394), 212 states have return successors, (394), 367 states have call predecessors, (394), 394 states have call successors, (394) [2022-01-10 01:09:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3482 transitions. [2022-01-10 01:09:12,797 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3482 transitions. Word has length 115 [2022-01-10 01:09:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:12,798 INFO L470 AbstractCegarLoop]: Abstraction has 2647 states and 3482 transitions. [2022-01-10 01:09:12,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3482 transitions. [2022-01-10 01:09:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-10 01:09:12,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:12,799 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:12,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 01:09:12,799 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash -368547624, now seen corresponding path program 1 times [2022-01-10 01:09:12,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:12,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404522724] [2022-01-10 01:09:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:12,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-10 01:09:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 01:09:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-10 01:09:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 01:09:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-10 01:09:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-10 01:09:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-10 01:09:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:12,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:12,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404522724] [2022-01-10 01:09:12,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404522724] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:12,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:12,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:09:12,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211705402] [2022-01-10 01:09:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:12,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:09:12,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:09:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:12,851 INFO L87 Difference]: Start difference. First operand 2647 states and 3482 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:13,246 INFO L93 Difference]: Finished difference Result 6362 states and 8738 transitions. [2022-01-10 01:09:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:09:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-01-10 01:09:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:13,269 INFO L225 Difference]: With dead ends: 6362 [2022-01-10 01:09:13,269 INFO L226 Difference]: Without dead ends: 3959 [2022-01-10 01:09:13,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:13,276 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 152 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:13,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 678 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2022-01-10 01:09:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 2650. [2022-01-10 01:09:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2043 states have (on average 1.3201174743024964) internal successors, (2697), 2070 states have internal predecessors, (2697), 394 states have call successors, (394), 212 states have call predecessors, (394), 212 states have return successors, (394), 367 states have call predecessors, (394), 394 states have call successors, (394) [2022-01-10 01:09:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3485 transitions. [2022-01-10 01:09:13,560 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3485 transitions. Word has length 115 [2022-01-10 01:09:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:13,560 INFO L470 AbstractCegarLoop]: Abstraction has 2650 states and 3485 transitions. [2022-01-10 01:09:13,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3485 transitions. [2022-01-10 01:09:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-10 01:09:13,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:13,562 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:13,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 01:09:13,563 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:13,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:13,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1965817841, now seen corresponding path program 1 times [2022-01-10 01:09:13,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:13,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634425864] [2022-01-10 01:09:13,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:13,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-10 01:09:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 01:09:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-10 01:09:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 01:09:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-10 01:09:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-10 01:09:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-10 01:09:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:13,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:13,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634425864] [2022-01-10 01:09:13,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634425864] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:13,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:13,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:13,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023624846] [2022-01-10 01:09:13,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:13,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:13,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:13,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:13,620 INFO L87 Difference]: Start difference. First operand 2650 states and 3485 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:14,041 INFO L93 Difference]: Finished difference Result 6371 states and 8442 transitions. [2022-01-10 01:09:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:14,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-01-10 01:09:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:14,074 INFO L225 Difference]: With dead ends: 6371 [2022-01-10 01:09:14,074 INFO L226 Difference]: Without dead ends: 4216 [2022-01-10 01:09:14,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:14,079 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 419 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:14,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 1252 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2022-01-10 01:09:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 3628. [2022-01-10 01:09:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 2782 states have (on average 1.318116462976276) internal successors, (3667), 2819 states have internal predecessors, (3667), 551 states have call successors, (551), 294 states have call predecessors, (551), 294 states have return successors, (551), 514 states have call predecessors, (551), 551 states have call successors, (551) [2022-01-10 01:09:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 4769 transitions. [2022-01-10 01:09:14,337 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 4769 transitions. Word has length 115 [2022-01-10 01:09:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:14,337 INFO L470 AbstractCegarLoop]: Abstraction has 3628 states and 4769 transitions. [2022-01-10 01:09:14,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 4769 transitions. [2022-01-10 01:09:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-10 01:09:14,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:14,339 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:14,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 01:09:14,339 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:14,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1320441289, now seen corresponding path program 1 times [2022-01-10 01:09:14,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:14,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011921114] [2022-01-10 01:09:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:14,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:09:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:09:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:09:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:09:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:09:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-10 01:09:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:14,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:14,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011921114] [2022-01-10 01:09:14,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011921114] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:14,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:14,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:14,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195197342] [2022-01-10 01:09:14,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:14,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:14,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:14,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:14,406 INFO L87 Difference]: Start difference. First operand 3628 states and 4769 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:14,766 INFO L93 Difference]: Finished difference Result 7548 states and 10139 transitions. [2022-01-10 01:09:14,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:14,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2022-01-10 01:09:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:14,778 INFO L225 Difference]: With dead ends: 7548 [2022-01-10 01:09:14,778 INFO L226 Difference]: Without dead ends: 4013 [2022-01-10 01:09:14,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:14,785 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 369 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:14,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 863 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2022-01-10 01:09:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3154. [2022-01-10 01:09:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3154 states, 2385 states have (on average 1.3174004192872117) internal successors, (3142), 2409 states have internal predecessors, (3142), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2022-01-10 01:09:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 4146 transitions. [2022-01-10 01:09:15,047 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 4146 transitions. Word has length 116 [2022-01-10 01:09:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:15,048 INFO L470 AbstractCegarLoop]: Abstraction has 3154 states and 4146 transitions. [2022-01-10 01:09:15,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 4146 transitions. [2022-01-10 01:09:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 01:09:15,049 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:15,049 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:15,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 01:09:15,049 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:15,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash 685811798, now seen corresponding path program 1 times [2022-01-10 01:09:15,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:15,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779237919] [2022-01-10 01:09:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:15,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:09:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:09:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:09:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:09:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:09:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-10 01:09:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:15,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:15,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779237919] [2022-01-10 01:09:15,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779237919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:15,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:15,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:09:15,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979175220] [2022-01-10 01:09:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:15,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:09:15,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:15,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:09:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:15,088 INFO L87 Difference]: Start difference. First operand 3154 states and 4146 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:15,494 INFO L93 Difference]: Finished difference Result 6870 states and 9262 transitions. [2022-01-10 01:09:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:09:15,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2022-01-10 01:09:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:15,503 INFO L225 Difference]: With dead ends: 6870 [2022-01-10 01:09:15,504 INFO L226 Difference]: Without dead ends: 3929 [2022-01-10 01:09:15,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:15,508 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 152 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:15,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 661 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3929 states. [2022-01-10 01:09:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3929 to 3161. [2022-01-10 01:09:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 2392 states have (on average 1.3164715719063544) internal successors, (3149), 2416 states have internal predecessors, (3149), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2022-01-10 01:09:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 4153 transitions. [2022-01-10 01:09:15,748 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 4153 transitions. Word has length 118 [2022-01-10 01:09:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:15,748 INFO L470 AbstractCegarLoop]: Abstraction has 3161 states and 4153 transitions. [2022-01-10 01:09:15,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 4153 transitions. [2022-01-10 01:09:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 01:09:15,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:15,750 INFO L514 BasicCegarLoop]: 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] [2022-01-10 01:09:15,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 01:09:15,750 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash 244049482, now seen corresponding path program 1 times [2022-01-10 01:09:15,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:15,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025864276] [2022-01-10 01:09:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:15,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:09:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:09:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:09:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:09:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:09:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-10 01:09:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:15,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:15,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025864276] [2022-01-10 01:09:15,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025864276] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:15,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:15,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:15,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146266283] [2022-01-10 01:09:15,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:15,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:15,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:15,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:15,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:15,822 INFO L87 Difference]: Start difference. First operand 3161 states and 4153 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:16,190 INFO L93 Difference]: Finished difference Result 6836 states and 9224 transitions. [2022-01-10 01:09:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2022-01-10 01:09:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:16,201 INFO L225 Difference]: With dead ends: 6836 [2022-01-10 01:09:16,201 INFO L226 Difference]: Without dead ends: 3821 [2022-01-10 01:09:16,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:16,208 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 278 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:16,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 875 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2022-01-10 01:09:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 2903. [2022-01-10 01:09:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2193 states have (on average 1.3141814865481076) internal successors, (2882), 2212 states have internal predecessors, (2882), 464 states have call successors, (464), 245 states have call predecessors, (464), 245 states have return successors, (464), 445 states have call predecessors, (464), 464 states have call successors, (464) [2022-01-10 01:09:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 3810 transitions. [2022-01-10 01:09:16,480 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 3810 transitions. Word has length 118 [2022-01-10 01:09:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:16,480 INFO L470 AbstractCegarLoop]: Abstraction has 2903 states and 3810 transitions. [2022-01-10 01:09:16,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 3810 transitions. [2022-01-10 01:09:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-10 01:09:16,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:16,484 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:16,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 01:09:16,485 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:16,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1017640442, now seen corresponding path program 1 times [2022-01-10 01:09:16,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:16,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071668364] [2022-01-10 01:09:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:16,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-01-10 01:09:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:09:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-01-10 01:09:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-01-10 01:09:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-01-10 01:09:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-01-10 01:09:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-01-10 01:09:16,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:16,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071668364] [2022-01-10 01:09:16,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071668364] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:16,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485871444] [2022-01-10 01:09:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:16,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:16,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:16,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:16,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 01:09:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 01:09:16,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 01:09:17,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-10 01:09:17,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485871444] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:17,644 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:17,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-01-10 01:09:17,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730184873] [2022-01-10 01:09:17,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:17,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 01:09:17,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 01:09:17,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-01-10 01:09:17,646 INFO L87 Difference]: Start difference. First operand 2903 states and 3810 transitions. Second operand has 19 states, 19 states have (on average 14.526315789473685) internal successors, (276), 18 states have internal predecessors, (276), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (39), 8 states have call predecessors, (39), 7 states have call successors, (39) [2022-01-10 01:09:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:24,073 INFO L93 Difference]: Finished difference Result 10536 states and 14440 transitions. [2022-01-10 01:09:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-01-10 01:09:24,074 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 14.526315789473685) internal successors, (276), 18 states have internal predecessors, (276), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (39), 8 states have call predecessors, (39), 7 states have call successors, (39) Word has length 186 [2022-01-10 01:09:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:24,091 INFO L225 Difference]: With dead ends: 10536 [2022-01-10 01:09:24,091 INFO L226 Difference]: Without dead ends: 7876 [2022-01-10 01:09:24,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4892 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2387, Invalid=10953, Unknown=0, NotChecked=0, Total=13340 [2022-01-10 01:09:24,099 INFO L933 BasicCegarLoop]: 641 mSDtfsCounter, 6205 mSDsluCounter, 6110 mSDsCounter, 0 mSdLazyCounter, 5264 mSolverCounterSat, 2619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6205 SdHoareTripleChecker+Valid, 6751 SdHoareTripleChecker+Invalid, 7883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2619 IncrementalHoareTripleChecker+Valid, 5264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:24,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6205 Valid, 6751 Invalid, 7883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2619 Valid, 5264 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-01-10 01:09:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7876 states. [2022-01-10 01:09:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7876 to 4375. [2022-01-10 01:09:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4375 states, 3341 states have (on average 1.3115833582759653) internal successors, (4382), 3366 states have internal predecessors, (4382), 666 states have call successors, (666), 367 states have call predecessors, (666), 367 states have return successors, (666), 641 states have call predecessors, (666), 666 states have call successors, (666) [2022-01-10 01:09:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 5714 transitions. [2022-01-10 01:09:24,502 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 5714 transitions. Word has length 186 [2022-01-10 01:09:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:24,503 INFO L470 AbstractCegarLoop]: Abstraction has 4375 states and 5714 transitions. [2022-01-10 01:09:24,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.526315789473685) internal successors, (276), 18 states have internal predecessors, (276), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (39), 8 states have call predecessors, (39), 7 states have call successors, (39) [2022-01-10 01:09:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 5714 transitions. [2022-01-10 01:09:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-10 01:09:24,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:24,509 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:24,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 01:09:24,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-10 01:09:24,728 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:24,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1082071072, now seen corresponding path program 1 times [2022-01-10 01:09:24,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:24,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097968806] [2022-01-10 01:09:24,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:24,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-01-10 01:09:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:09:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-01-10 01:09:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-01-10 01:09:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-01-10 01:09:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-01-10 01:09:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-01-10 01:09:24,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:24,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097968806] [2022-01-10 01:09:24,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097968806] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:24,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673691774] [2022-01-10 01:09:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:24,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:24,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:24,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:24,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 01:09:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:25,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:09:25,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 01:09:25,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-01-10 01:09:25,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673691774] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:25,741 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:25,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-01-10 01:09:25,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184520943] [2022-01-10 01:09:25,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:25,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 01:09:25,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:25,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 01:09:25,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-10 01:09:25,743 INFO L87 Difference]: Start difference. First operand 4375 states and 5714 transitions. Second operand has 14 states, 14 states have (on average 18.928571428571427) internal successors, (265), 13 states have internal predecessors, (265), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-01-10 01:09:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:28,464 INFO L93 Difference]: Finished difference Result 11445 states and 15632 transitions. [2022-01-10 01:09:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-10 01:09:28,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.928571428571427) internal successors, (265), 13 states have internal predecessors, (265), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 186 [2022-01-10 01:09:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:28,485 INFO L225 Difference]: With dead ends: 11445 [2022-01-10 01:09:28,485 INFO L226 Difference]: Without dead ends: 7441 [2022-01-10 01:09:28,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2022-01-10 01:09:28,495 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 2915 mSDsluCounter, 3657 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2915 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:28,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2915 Valid, 4133 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 01:09:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7441 states. [2022-01-10 01:09:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7441 to 4375. [2022-01-10 01:09:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4375 states, 3341 states have (on average 1.3064950613588746) internal successors, (4365), 3366 states have internal predecessors, (4365), 666 states have call successors, (666), 367 states have call predecessors, (666), 367 states have return successors, (666), 641 states have call predecessors, (666), 666 states have call successors, (666) [2022-01-10 01:09:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 5697 transitions. [2022-01-10 01:09:28,977 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 5697 transitions. Word has length 186 [2022-01-10 01:09:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:28,977 INFO L470 AbstractCegarLoop]: Abstraction has 4375 states and 5697 transitions. [2022-01-10 01:09:28,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.928571428571427) internal successors, (265), 13 states have internal predecessors, (265), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-01-10 01:09:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 5697 transitions. [2022-01-10 01:09:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-10 01:09:28,985 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:28,985 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:29,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 01:09:29,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-10 01:09:29,198 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:29,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash -848553665, now seen corresponding path program 1 times [2022-01-10 01:09:29,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:29,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410536620] [2022-01-10 01:09:29,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:29,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-01-10 01:09:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-01-10 01:09:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-01-10 01:09:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-01-10 01:09:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-10 01:09:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-01-10 01:09:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-10 01:09:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-10 01:09:29,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:29,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410536620] [2022-01-10 01:09:29,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410536620] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:29,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:29,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:29,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25269177] [2022-01-10 01:09:29,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:29,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:29,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:29,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:29,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:29,287 INFO L87 Difference]: Start difference. First operand 4375 states and 5697 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-10 01:09:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:30,530 INFO L93 Difference]: Finished difference Result 14775 states and 19879 transitions. [2022-01-10 01:09:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 01:09:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 195 [2022-01-10 01:09:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:30,554 INFO L225 Difference]: With dead ends: 14775 [2022-01-10 01:09:30,555 INFO L226 Difference]: Without dead ends: 10798 [2022-01-10 01:09:30,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:09:30,563 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 814 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:30,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [831 Valid, 2987 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:09:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10798 states. [2022-01-10 01:09:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10798 to 6095. [2022-01-10 01:09:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6095 states, 4585 states have (on average 1.3042529989094875) internal successors, (5980), 4622 states have internal predecessors, (5980), 986 states have call successors, (986), 523 states have call predecessors, (986), 523 states have return successors, (986), 949 states have call predecessors, (986), 986 states have call successors, (986) [2022-01-10 01:09:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6095 states to 6095 states and 7952 transitions. [2022-01-10 01:09:31,207 INFO L78 Accepts]: Start accepts. Automaton has 6095 states and 7952 transitions. Word has length 195 [2022-01-10 01:09:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:31,210 INFO L470 AbstractCegarLoop]: Abstraction has 6095 states and 7952 transitions. [2022-01-10 01:09:31,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-10 01:09:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6095 states and 7952 transitions. [2022-01-10 01:09:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-10 01:09:31,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:31,218 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:31,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 01:09:31,218 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:31,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1979235098, now seen corresponding path program 1 times [2022-01-10 01:09:31,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:31,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257953415] [2022-01-10 01:09:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:31,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-01-10 01:09:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-01-10 01:09:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:09:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-10 01:09:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-01-10 01:09:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-01-10 01:09:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-01-10 01:09:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-01-10 01:09:31,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:31,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257953415] [2022-01-10 01:09:31,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257953415] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:31,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920007345] [2022-01-10 01:09:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:31,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:31,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:31,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:31,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 01:09:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:31,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 01:09:31,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 01:09:31,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-01-10 01:09:32,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920007345] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:32,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:32,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-01-10 01:09:32,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605922209] [2022-01-10 01:09:32,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:32,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 01:09:32,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:32,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 01:09:32,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-01-10 01:09:32,158 INFO L87 Difference]: Start difference. First operand 6095 states and 7952 transitions. Second operand has 16 states, 16 states have (on average 18.25) internal successors, (292), 15 states have internal predecessors, (292), 7 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (43), 8 states have call predecessors, (43), 7 states have call successors, (43) [2022-01-10 01:09:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:40,170 INFO L93 Difference]: Finished difference Result 25555 states and 34837 transitions. [2022-01-10 01:09:40,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-01-10 01:09:40,170 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 18.25) internal successors, (292), 15 states have internal predecessors, (292), 7 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (43), 8 states have call predecessors, (43), 7 states have call successors, (43) Word has length 197 [2022-01-10 01:09:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:40,220 INFO L225 Difference]: With dead ends: 25555 [2022-01-10 01:09:40,220 INFO L226 Difference]: Without dead ends: 19858 [2022-01-10 01:09:40,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 475 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8832 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3372, Invalid=18384, Unknown=0, NotChecked=0, Total=21756 [2022-01-10 01:09:40,234 INFO L933 BasicCegarLoop]: 808 mSDtfsCounter, 11199 mSDsluCounter, 5307 mSDsCounter, 0 mSdLazyCounter, 4040 mSolverCounterSat, 5030 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11199 SdHoareTripleChecker+Valid, 6115 SdHoareTripleChecker+Invalid, 9070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5030 IncrementalHoareTripleChecker+Valid, 4040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:40,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11199 Valid, 6115 Invalid, 9070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5030 Valid, 4040 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-01-10 01:09:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19858 states. [2022-01-10 01:09:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19858 to 8804. [2022-01-10 01:09:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8804 states, 6596 states have (on average 1.2997271073377805) internal successors, (8573), 6651 states have internal predecessors, (8573), 1438 states have call successors, (1438), 769 states have call predecessors, (1438), 769 states have return successors, (1438), 1383 states have call predecessors, (1438), 1438 states have call successors, (1438) [2022-01-10 01:09:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8804 states to 8804 states and 11449 transitions. [2022-01-10 01:09:41,348 INFO L78 Accepts]: Start accepts. Automaton has 8804 states and 11449 transitions. Word has length 197 [2022-01-10 01:09:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:41,349 INFO L470 AbstractCegarLoop]: Abstraction has 8804 states and 11449 transitions. [2022-01-10 01:09:41,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.25) internal successors, (292), 15 states have internal predecessors, (292), 7 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (43), 8 states have call predecessors, (43), 7 states have call successors, (43) [2022-01-10 01:09:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 8804 states and 11449 transitions. [2022-01-10 01:09:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-10 01:09:41,359 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:41,360 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:41,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 01:09:41,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:41,577 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:41,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2112351607, now seen corresponding path program 1 times [2022-01-10 01:09:41,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:41,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173980421] [2022-01-10 01:09:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:41,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-01-10 01:09:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 01:09:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 01:09:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-01-10 01:09:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-10 01:09:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-01-10 01:09:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-01-10 01:09:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-01-10 01:09:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-01-10 01:09:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-01-10 01:09:41,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:41,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173980421] [2022-01-10 01:09:41,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173980421] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:41,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112340754] [2022-01-10 01:09:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:41,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:41,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:41,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:41,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 01:09:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:41,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 01:09:41,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-10 01:09:42,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-10 01:09:42,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112340754] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:42,426 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:42,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-01-10 01:09:42,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568265949] [2022-01-10 01:09:42,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:42,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 01:09:42,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 01:09:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-01-10 01:09:42,428 INFO L87 Difference]: Start difference. First operand 8804 states and 11449 transitions. Second operand has 17 states, 17 states have (on average 14.647058823529411) internal successors, (249), 16 states have internal predecessors, (249), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-01-10 01:09:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:47,549 INFO L93 Difference]: Finished difference Result 26224 states and 35927 transitions. [2022-01-10 01:09:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-10 01:09:47,549 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.647058823529411) internal successors, (249), 16 states have internal predecessors, (249), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 198 [2022-01-10 01:09:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:47,589 INFO L225 Difference]: With dead ends: 26224 [2022-01-10 01:09:47,590 INFO L226 Difference]: Without dead ends: 17740 [2022-01-10 01:09:47,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=662, Invalid=4168, Unknown=0, NotChecked=0, Total=4830 [2022-01-10 01:09:47,602 INFO L933 BasicCegarLoop]: 846 mSDtfsCounter, 2724 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 4604 mSolverCounterSat, 1223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 8912 SdHoareTripleChecker+Invalid, 5827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1223 IncrementalHoareTripleChecker+Valid, 4604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:47,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2724 Valid, 8912 Invalid, 5827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1223 Valid, 4604 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-10 01:09:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17740 states. [2022-01-10 01:09:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17740 to 10202. [2022-01-10 01:09:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 7620 states have (on average 1.2964566929133858) internal successors, (9879), 7685 states have internal predecessors, (9879), 1676 states have call successors, (1676), 905 states have call predecessors, (1676), 905 states have return successors, (1676), 1611 states have call predecessors, (1676), 1676 states have call successors, (1676) [2022-01-10 01:09:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 13231 transitions. [2022-01-10 01:09:48,909 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 13231 transitions. Word has length 198 [2022-01-10 01:09:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:48,909 INFO L470 AbstractCegarLoop]: Abstraction has 10202 states and 13231 transitions. [2022-01-10 01:09:48,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.647058823529411) internal successors, (249), 16 states have internal predecessors, (249), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-01-10 01:09:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 13231 transitions. [2022-01-10 01:09:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-01-10 01:09:48,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:48,926 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:48,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 01:09:49,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:49,139 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash 119415747, now seen corresponding path program 1 times [2022-01-10 01:09:49,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:49,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564006334] [2022-01-10 01:09:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:49,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-01-10 01:09:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 01:09:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-01-10 01:09:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-10 01:09:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-01-10 01:09:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-10 01:09:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-01-10 01:09:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-01-10 01:09:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-01-10 01:09:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-01-10 01:09:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-10 01:09:49,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564006334] [2022-01-10 01:09:49,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564006334] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067394387] [2022-01-10 01:09:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:49,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:49,294 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:49,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 01:09:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:49,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:09:49,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 74 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-10 01:09:49,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-10 01:09:50,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067394387] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:50,034 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:50,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-01-10 01:09:50,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192955741] [2022-01-10 01:09:50,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:50,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:09:50,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:50,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:09:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:09:50,035 INFO L87 Difference]: Start difference. First operand 10202 states and 13231 transitions. Second operand has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 8 states have internal predecessors, (181), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-01-10 01:09:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:52,028 INFO L93 Difference]: Finished difference Result 24241 states and 32560 transitions. [2022-01-10 01:09:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 01:09:52,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 8 states have internal predecessors, (181), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 206 [2022-01-10 01:09:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:52,066 INFO L225 Difference]: With dead ends: 24241 [2022-01-10 01:09:52,066 INFO L226 Difference]: Without dead ends: 14427 [2022-01-10 01:09:52,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 441 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-10 01:09:52,078 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 287 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:52,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 2635 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14427 states. [2022-01-10 01:09:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14427 to 10202. [2022-01-10 01:09:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 7620 states have (on average 1.2955380577427822) internal successors, (9872), 7685 states have internal predecessors, (9872), 1676 states have call successors, (1676), 905 states have call predecessors, (1676), 905 states have return successors, (1676), 1611 states have call predecessors, (1676), 1676 states have call successors, (1676) [2022-01-10 01:09:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 13224 transitions. [2022-01-10 01:09:53,432 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 13224 transitions. Word has length 206 [2022-01-10 01:09:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:53,432 INFO L470 AbstractCegarLoop]: Abstraction has 10202 states and 13224 transitions. [2022-01-10 01:09:53,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 8 states have internal predecessors, (181), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-01-10 01:09:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 13224 transitions. [2022-01-10 01:09:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-01-10 01:09:53,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:53,449 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:53,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 01:09:53,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-01-10 01:09:53,667 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:53,667 INFO L85 PathProgramCache]: Analyzing trace with hash 805721994, now seen corresponding path program 1 times [2022-01-10 01:09:53,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:53,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205457590] [2022-01-10 01:09:53,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:53,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-10 01:09:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 01:09:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:09:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-10 01:09:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-01-10 01:09:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-01-10 01:09:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-01-10 01:09:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-01-10 01:09:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-01-10 01:09:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-01-10 01:09:53,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:53,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205457590] [2022-01-10 01:09:53,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205457590] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:53,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:53,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:53,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105442252] [2022-01-10 01:09:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:53,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:53,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:53,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:53,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:53,768 INFO L87 Difference]: Start difference. First operand 10202 states and 13224 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2022-01-10 01:09:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:54,632 INFO L93 Difference]: Finished difference Result 16456 states and 21423 transitions. [2022-01-10 01:09:54,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:54,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 213 [2022-01-10 01:09:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:54,649 INFO L225 Difference]: With dead ends: 16456 [2022-01-10 01:09:54,650 INFO L226 Difference]: Without dead ends: 6610 [2022-01-10 01:09:54,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:09:54,661 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 2 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:54,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2022-01-10 01:09:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 6610. [2022-01-10 01:09:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6610 states, 4952 states have (on average 1.2952342487883683) internal successors, (6414), 4993 states have internal predecessors, (6414), 1080 states have call successors, (1080), 577 states have call predecessors, (1080), 577 states have return successors, (1080), 1039 states have call predecessors, (1080), 1080 states have call successors, (1080) [2022-01-10 01:09:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6610 states to 6610 states and 8574 transitions. [2022-01-10 01:09:55,448 INFO L78 Accepts]: Start accepts. Automaton has 6610 states and 8574 transitions. Word has length 213 [2022-01-10 01:09:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:55,448 INFO L470 AbstractCegarLoop]: Abstraction has 6610 states and 8574 transitions. [2022-01-10 01:09:55,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2022-01-10 01:09:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6610 states and 8574 transitions. [2022-01-10 01:09:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-01-10 01:09:55,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:55,458 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:55,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 01:09:55,458 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash -141131184, now seen corresponding path program 1 times [2022-01-10 01:09:55,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:55,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856310215] [2022-01-10 01:09:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:55,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-10 01:09:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 01:09:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:09:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-01-10 01:09:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-01-10 01:09:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-01-10 01:09:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-01-10 01:09:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-01-10 01:09:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-01-10 01:09:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 01:09:55,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:55,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856310215] [2022-01-10 01:09:55,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856310215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:55,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:55,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:55,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780950789] [2022-01-10 01:09:55,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:55,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:55,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:55,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:55,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:55,552 INFO L87 Difference]: Start difference. First operand 6610 states and 8574 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-10 01:09:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:56,333 INFO L93 Difference]: Finished difference Result 12567 states and 16379 transitions. [2022-01-10 01:09:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:56,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 213 [2022-01-10 01:09:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:56,349 INFO L225 Difference]: With dead ends: 12567 [2022-01-10 01:09:56,349 INFO L226 Difference]: Without dead ends: 6246 [2022-01-10 01:09:56,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:56,358 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 435 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:56,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 463 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2022-01-10 01:09:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2022-01-10 01:09:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6246 states, 4682 states have (on average 1.2964545066211022) internal successors, (6070), 4721 states have internal predecessors, (6070), 1020 states have call successors, (1020), 543 states have call predecessors, (1020), 543 states have return successors, (1020), 981 states have call predecessors, (1020), 1020 states have call successors, (1020) [2022-01-10 01:09:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 8110 transitions. [2022-01-10 01:09:57,099 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 8110 transitions. Word has length 213 [2022-01-10 01:09:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:57,099 INFO L470 AbstractCegarLoop]: Abstraction has 6246 states and 8110 transitions. [2022-01-10 01:09:57,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-10 01:09:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 8110 transitions. [2022-01-10 01:09:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-01-10 01:09:57,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:57,108 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:57,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 01:09:57,108 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:57,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:57,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1714941869, now seen corresponding path program 1 times [2022-01-10 01:09:57,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:57,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484132475] [2022-01-10 01:09:57,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:57,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 01:09:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-01-10 01:09:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-10 01:09:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-10 01:09:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-01-10 01:09:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:09:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-10 01:09:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-10 01:09:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-10 01:09:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 01:09:57,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:57,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484132475] [2022-01-10 01:09:57,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484132475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:57,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:57,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:57,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991365684] [2022-01-10 01:09:57,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:57,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:57,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:57,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:57,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:57,184 INFO L87 Difference]: Start difference. First operand 6246 states and 8110 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-10 01:09:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:57,917 INFO L93 Difference]: Finished difference Result 11973 states and 15602 transitions. [2022-01-10 01:09:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:57,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 215 [2022-01-10 01:09:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:57,929 INFO L225 Difference]: With dead ends: 11973 [2022-01-10 01:09:57,929 INFO L226 Difference]: Without dead ends: 5934 [2022-01-10 01:09:57,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:57,937 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 278 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:57,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 430 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5934 states. [2022-01-10 01:09:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5934 to 5776. [2022-01-10 01:09:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5776 states, 4328 states have (on average 1.299445471349353) internal successors, (5624), 4364 states have internal predecessors, (5624), 943 states have call successors, (943), 504 states have call predecessors, (943), 504 states have return successors, (943), 907 states have call predecessors, (943), 943 states have call successors, (943) [2022-01-10 01:09:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 7510 transitions. [2022-01-10 01:09:58,626 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 7510 transitions. Word has length 215 [2022-01-10 01:09:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:58,626 INFO L470 AbstractCegarLoop]: Abstraction has 5776 states and 7510 transitions. [2022-01-10 01:09:58,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-10 01:09:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 7510 transitions. [2022-01-10 01:09:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-10 01:09:58,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:58,637 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:58,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 01:09:58,638 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash 925716466, now seen corresponding path program 1 times [2022-01-10 01:09:58,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:58,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948877456] [2022-01-10 01:09:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:58,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-10 01:09:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 01:09:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:09:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-01-10 01:09:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:09:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-01-10 01:09:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-01-10 01:09:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-01-10 01:09:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-01-10 01:09:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-01-10 01:09:58,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:58,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948877456] [2022-01-10 01:09:58,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948877456] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:58,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172611311] [2022-01-10 01:09:58,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:58,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:58,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:58,781 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:58,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 01:09:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 01:09:58,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 69 proven. 40 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 01:09:59,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:10:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-01-10 01:10:00,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172611311] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:10:00,876 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:10:00,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 10] total 23 [2022-01-10 01:10:00,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442460329] [2022-01-10 01:10:00,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:10:00,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 01:10:00,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:10:00,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 01:10:00,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-01-10 01:10:00,878 INFO L87 Difference]: Start difference. First operand 5776 states and 7510 transitions. Second operand has 23 states, 23 states have (on average 16.47826086956522) internal successors, (379), 23 states have internal predecessors, (379), 9 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46)