/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 12:57:30,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 12:57:30,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 12:57:30,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 12:57:30,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 12:57:30,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 12:57:30,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 12:57:30,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 12:57:30,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 12:57:30,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 12:57:30,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 12:57:30,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 12:57:30,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 12:57:30,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 12:57:30,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 12:57:30,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 12:57:30,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 12:57:30,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 12:57:30,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 12:57:30,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 12:57:30,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 12:57:30,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 12:57:30,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 12:57:30,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 12:57:30,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 12:57:30,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 12:57:30,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 12:57:30,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 12:57:30,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 12:57:30,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 12:57:30,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 12:57:30,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 12:57:30,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 12:57:30,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 12:57:30,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 12:57:30,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 12:57:30,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 12:57:30,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 12:57:30,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 12:57:30,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 12:57:30,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 12:57:30,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 12:57:30,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 12:57:30,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 12:57:30,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 12:57:30,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 12:57:30,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 12:57:30,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 12:57:30,618 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 12:57:30,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 12:57:30,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 12:57:30,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:57:30,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 12:57:30,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 12:57:30,621 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 12:57:30,621 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 12:57:30,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 12:57:30,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 12:57:30,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 12:57:30,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 12:57:30,826 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 12:57:30,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-01-10 12:57:30,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199b135e7/ddf7b67a60ba49cb9eff757f143297d9/FLAG7cf1a70d8 [2022-01-10 12:57:31,286 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 12:57:31,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-01-10 12:57:31,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199b135e7/ddf7b67a60ba49cb9eff757f143297d9/FLAG7cf1a70d8 [2022-01-10 12:57:31,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199b135e7/ddf7b67a60ba49cb9eff757f143297d9 [2022-01-10 12:57:31,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 12:57:31,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 12:57:31,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 12:57:31,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 12:57:31,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 12:57:31,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40bc3f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31, skipping insertion in model container [2022-01-10 12:57:31,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 12:57:31,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:57:31,565 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-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532] [2022-01-10 12:57:31,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:57:31,627 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 12:57:31,695 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-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532] [2022-01-10 12:57:31,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:57:31,752 INFO L208 MainTranslator]: Completed translation [2022-01-10 12:57:31,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31 WrapperNode [2022-01-10 12:57:31,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 12:57:31,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 12:57:31,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 12:57:31,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 12:57:31,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 12:57:31" (1/1) ... [2022-01-10 12:57:31,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,828 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1165 [2022-01-10 12:57:31,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 12:57:31,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 12:57:31,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 12:57:31,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 12:57:31,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 12:57:31,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 12:57:31,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 12:57:31,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 12:57:31,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (1/1) ... [2022-01-10 12:57:31,873 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:57:31,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:57:31,903 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 12:57:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 12:57:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 12:57:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 12:57:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 12:57:31,932 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 12:57:32,061 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 12:57:32,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 12:57:32,757 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 12:57:32,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 12:57:32,768 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 12:57:32,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:32 BoogieIcfgContainer [2022-01-10 12:57:32,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 12:57:32,771 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 12:57:32,771 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 12:57:32,772 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 12:57:32,774 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:32" (1/1) ... [2022-01-10 12:57:33,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:57:33 BasicIcfg [2022-01-10 12:57:33,331 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 12:57:33,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 12:57:33,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 12:57:33,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 12:57:33,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:57:31" (1/4) ... [2022-01-10 12:57:33,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6b2c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:33, skipping insertion in model container [2022-01-10 12:57:33,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:31" (2/4) ... [2022-01-10 12:57:33,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6b2c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:33, skipping insertion in model container [2022-01-10 12:57:33,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:32" (3/4) ... [2022-01-10 12:57:33,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6b2c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:57:33, skipping insertion in model container [2022-01-10 12:57:33,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:57:33" (4/4) ... [2022-01-10 12:57:33,339 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.cTransformedIcfg [2022-01-10 12:57:33,343 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 12:57:33,344 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 12:57:33,386 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 12:57:33,390 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 12:57:33,390 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 12:57:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 303 states have (on average 1.7854785478547854) internal successors, (541), 304 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-01-10 12:57:33,416 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:33,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:33,418 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:33,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1634069325, now seen corresponding path program 1 times [2022-01-10 12:57:33,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:33,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125152407] [2022-01-10 12:57:33,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:33,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:33,896 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 12:57:33,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:33,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125152407] [2022-01-10 12:57:33,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125152407] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:33,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:33,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:57:33,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601676437] [2022-01-10 12:57:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:33,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:57:33,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:33,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:57:33,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:57:33,934 INFO L87 Difference]: Start difference. First operand has 305 states, 303 states have (on average 1.7854785478547854) internal successors, (541), 304 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:34,079 INFO L93 Difference]: Finished difference Result 869 states and 1546 transitions. [2022-01-10 12:57:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:57:34,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-01-10 12:57:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:34,098 INFO L225 Difference]: With dead ends: 869 [2022-01-10 12:57:34,098 INFO L226 Difference]: Without dead ends: 583 [2022-01-10 12:57:34,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:57:34,107 INFO L933 BasicCegarLoop]: 918 mSDtfsCounter, 1114 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:34,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1114 Valid, 1412 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-01-10 12:57:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2022-01-10 12:57:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.4551724137931035) internal successors, (844), 580 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 844 transitions. [2022-01-10 12:57:34,176 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 844 transitions. Word has length 144 [2022-01-10 12:57:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:34,177 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 844 transitions. [2022-01-10 12:57:34,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 844 transitions. [2022-01-10 12:57:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 12:57:34,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:34,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:34,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 12:57:34,180 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:34,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash -401299054, now seen corresponding path program 1 times [2022-01-10 12:57:34,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:34,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824725421] [2022-01-10 12:57:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:34,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:34,336 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 12:57:34,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:34,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824725421] [2022-01-10 12:57:34,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824725421] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:34,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:34,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:57:34,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865803454] [2022-01-10 12:57:34,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:34,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:57:34,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:34,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:57:34,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:57:34,340 INFO L87 Difference]: Start difference. First operand 581 states and 844 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:34,380 INFO L93 Difference]: Finished difference Result 1705 states and 2468 transitions. [2022-01-10 12:57:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:57:34,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2022-01-10 12:57:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:34,384 INFO L225 Difference]: With dead ends: 1705 [2022-01-10 12:57:34,384 INFO L226 Difference]: Without dead ends: 1152 [2022-01-10 12:57:34,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:34,389 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 432 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:34,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 944 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-01-10 12:57:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 583. [2022-01-10 12:57:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.4536082474226804) internal successors, (846), 582 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 846 transitions. [2022-01-10 12:57:34,424 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 846 transitions. Word has length 145 [2022-01-10 12:57:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:34,426 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 846 transitions. [2022-01-10 12:57:34,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 846 transitions. [2022-01-10 12:57:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-01-10 12:57:34,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:34,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:34,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 12:57:34,432 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash 26329260, now seen corresponding path program 1 times [2022-01-10 12:57:34,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:34,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197807749] [2022-01-10 12:57:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:34,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:34,582 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 12:57:34,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:34,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197807749] [2022-01-10 12:57:34,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197807749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:34,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:34,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:57:34,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087575246] [2022-01-10 12:57:34,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:34,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:57:34,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:34,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:57:34,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:57:34,584 INFO L87 Difference]: Start difference. First operand 583 states and 846 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:34,615 INFO L93 Difference]: Finished difference Result 1156 states and 1677 transitions. [2022-01-10 12:57:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:57:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-01-10 12:57:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:34,617 INFO L225 Difference]: With dead ends: 1156 [2022-01-10 12:57:34,617 INFO L226 Difference]: Without dead ends: 581 [2022-01-10 12:57:34,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:57:34,623 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 69 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:34,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1363 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-01-10 12:57:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2022-01-10 12:57:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.4517241379310344) internal successors, (842), 580 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 842 transitions. [2022-01-10 12:57:34,648 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 842 transitions. Word has length 146 [2022-01-10 12:57:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:34,648 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 842 transitions. [2022-01-10 12:57:34,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 842 transitions. [2022-01-10 12:57:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-01-10 12:57:34,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:34,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:34,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 12:57:34,652 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1837075528, now seen corresponding path program 1 times [2022-01-10 12:57:34,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:34,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613956120] [2022-01-10 12:57:34,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:34,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:34,815 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 12:57:34,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:34,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613956120] [2022-01-10 12:57:34,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613956120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:34,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:34,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:57:34,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014460082] [2022-01-10 12:57:34,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:34,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:57:34,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:34,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:57:34,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:57:34,817 INFO L87 Difference]: Start difference. First operand 581 states and 842 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:34,921 INFO L93 Difference]: Finished difference Result 1714 states and 2472 transitions. [2022-01-10 12:57:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:57:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-01-10 12:57:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:34,925 INFO L225 Difference]: With dead ends: 1714 [2022-01-10 12:57:34,925 INFO L226 Difference]: Without dead ends: 1143 [2022-01-10 12:57:34,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:57:34,930 INFO L933 BasicCegarLoop]: 912 mSDtfsCounter, 1421 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:34,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1421 Valid, 1697 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-01-10 12:57:34,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 856. [2022-01-10 12:57:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.4280701754385965) internal successors, (1221), 855 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1221 transitions. [2022-01-10 12:57:34,964 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1221 transitions. Word has length 146 [2022-01-10 12:57:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:34,966 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1221 transitions. [2022-01-10 12:57:34,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1221 transitions. [2022-01-10 12:57:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-10 12:57:34,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:34,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:34,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 12:57:34,968 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash 994359887, now seen corresponding path program 1 times [2022-01-10 12:57:34,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:34,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663618729] [2022-01-10 12:57:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:34,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:35,042 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 12:57:35,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:35,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663618729] [2022-01-10 12:57:35,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663618729] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:35,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:35,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:57:35,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211136493] [2022-01-10 12:57:35,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:35,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:57:35,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:35,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:57:35,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:57:35,044 INFO L87 Difference]: Start difference. First operand 856 states and 1221 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:35,114 INFO L93 Difference]: Finished difference Result 1694 states and 2406 transitions. [2022-01-10 12:57:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:57:35,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2022-01-10 12:57:35,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:35,117 INFO L225 Difference]: With dead ends: 1694 [2022-01-10 12:57:35,118 INFO L226 Difference]: Without dead ends: 1133 [2022-01-10 12:57:35,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:35,119 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 425 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:35,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 916 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-01-10 12:57:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 856. [2022-01-10 12:57:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.4269005847953216) internal successors, (1220), 855 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1220 transitions. [2022-01-10 12:57:35,170 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1220 transitions. Word has length 153 [2022-01-10 12:57:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:35,171 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1220 transitions. [2022-01-10 12:57:35,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1220 transitions. [2022-01-10 12:57:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 12:57:35,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:35,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:35,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 12:57:35,176 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:35,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:35,177 INFO L85 PathProgramCache]: Analyzing trace with hash -877462554, now seen corresponding path program 1 times [2022-01-10 12:57:35,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:35,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337577433] [2022-01-10 12:57:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:35,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:35,316 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 12:57:35,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:35,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337577433] [2022-01-10 12:57:35,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337577433] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:35,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:35,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:57:35,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143390045] [2022-01-10 12:57:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:35,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:57:35,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:35,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:57:35,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:57:35,318 INFO L87 Difference]: Start difference. First operand 856 states and 1220 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:35,408 INFO L93 Difference]: Finished difference Result 2183 states and 3143 transitions. [2022-01-10 12:57:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:57:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 12:57:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:35,413 INFO L225 Difference]: With dead ends: 2183 [2022-01-10 12:57:35,414 INFO L226 Difference]: Without dead ends: 1585 [2022-01-10 12:57:35,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:35,416 INFO L933 BasicCegarLoop]: 816 mSDtfsCounter, 366 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:35,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 1216 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2022-01-10 12:57:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1583. [2022-01-10 12:57:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1582 states have (on average 1.4171934260429835) internal successors, (2242), 1582 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2242 transitions. [2022-01-10 12:57:35,500 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2242 transitions. Word has length 154 [2022-01-10 12:57:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:35,501 INFO L470 AbstractCegarLoop]: Abstraction has 1583 states and 2242 transitions. [2022-01-10 12:57:35,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2242 transitions. [2022-01-10 12:57:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 12:57:35,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:35,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:35,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 12:57:35,503 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1009786299, now seen corresponding path program 1 times [2022-01-10 12:57:35,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:35,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557192017] [2022-01-10 12:57:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:35,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:35,581 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 12:57:35,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:35,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557192017] [2022-01-10 12:57:35,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557192017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:35,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:35,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:57:35,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662102803] [2022-01-10 12:57:35,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:35,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:57:35,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:35,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:57:35,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:57:35,582 INFO L87 Difference]: Start difference. First operand 1583 states and 2242 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:35,697 INFO L93 Difference]: Finished difference Result 3921 states and 5547 transitions. [2022-01-10 12:57:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:57:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 12:57:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:35,704 INFO L225 Difference]: With dead ends: 3921 [2022-01-10 12:57:35,704 INFO L226 Difference]: Without dead ends: 2422 [2022-01-10 12:57:35,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:57:35,706 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 1180 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:35,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1180 Valid, 933 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2022-01-10 12:57:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 1588. [2022-01-10 12:57:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1587 states have (on average 1.4139886578449905) internal successors, (2244), 1587 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2244 transitions. [2022-01-10 12:57:35,779 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2244 transitions. Word has length 154 [2022-01-10 12:57:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:35,779 INFO L470 AbstractCegarLoop]: Abstraction has 1588 states and 2244 transitions. [2022-01-10 12:57:35,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2244 transitions. [2022-01-10 12:57:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 12:57:35,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:35,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:35,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 12:57:35,782 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1343374299, now seen corresponding path program 1 times [2022-01-10 12:57:35,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:35,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189337708] [2022-01-10 12:57:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:35,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:35,892 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 12:57:35,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:35,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189337708] [2022-01-10 12:57:35,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189337708] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:35,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:35,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:57:35,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089185524] [2022-01-10 12:57:35,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:35,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:57:35,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:35,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:57:35,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:57:35,894 INFO L87 Difference]: Start difference. First operand 1588 states and 2244 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:36,099 INFO L93 Difference]: Finished difference Result 4528 states and 6385 transitions. [2022-01-10 12:57:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:57:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 12:57:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:36,107 INFO L225 Difference]: With dead ends: 4528 [2022-01-10 12:57:36,107 INFO L226 Difference]: Without dead ends: 3008 [2022-01-10 12:57:36,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:57:36,109 INFO L933 BasicCegarLoop]: 735 mSDtfsCounter, 865 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:36,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 1129 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-01-10 12:57:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3006. [2022-01-10 12:57:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 3005 states have (on average 1.399334442595674) internal successors, (4205), 3005 states have internal predecessors, (4205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 4205 transitions. [2022-01-10 12:57:36,322 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 4205 transitions. Word has length 154 [2022-01-10 12:57:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:36,322 INFO L470 AbstractCegarLoop]: Abstraction has 3006 states and 4205 transitions. [2022-01-10 12:57:36,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 4205 transitions. [2022-01-10 12:57:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-10 12:57:36,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:36,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:36,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 12:57:36,326 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1599426204, now seen corresponding path program 1 times [2022-01-10 12:57:36,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:36,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736141989] [2022-01-10 12:57:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:36,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:36,418 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 12:57:36,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:36,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736141989] [2022-01-10 12:57:36,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736141989] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:36,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:36,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:57:36,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336900159] [2022-01-10 12:57:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:36,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:57:36,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:36,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:57:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:57:36,420 INFO L87 Difference]: Start difference. First operand 3006 states and 4205 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:36,612 INFO L93 Difference]: Finished difference Result 4335 states and 6094 transitions. [2022-01-10 12:57:36,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:57:36,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2022-01-10 12:57:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:36,619 INFO L225 Difference]: With dead ends: 4335 [2022-01-10 12:57:36,619 INFO L226 Difference]: Without dead ends: 2505 [2022-01-10 12:57:36,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:57:36,624 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 47 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:36,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1345 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2022-01-10 12:57:36,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2505. [2022-01-10 12:57:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2504 states have (on average 1.3997603833865815) internal successors, (3505), 2504 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3505 transitions. [2022-01-10 12:57:36,775 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3505 transitions. Word has length 156 [2022-01-10 12:57:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:36,775 INFO L470 AbstractCegarLoop]: Abstraction has 2505 states and 3505 transitions. [2022-01-10 12:57:36,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3505 transitions. [2022-01-10 12:57:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-10 12:57:36,778 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:36,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:36,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 12:57:36,779 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:36,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1796828320, now seen corresponding path program 1 times [2022-01-10 12:57:36,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:36,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976610569] [2022-01-10 12:57:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:36,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:36,928 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 12:57:36,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:36,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976610569] [2022-01-10 12:57:36,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976610569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:36,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:36,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:57:36,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112948025] [2022-01-10 12:57:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:36,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:57:36,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:36,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:57:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:57:36,930 INFO L87 Difference]: Start difference. First operand 2505 states and 3505 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:37,199 INFO L93 Difference]: Finished difference Result 6585 states and 9182 transitions. [2022-01-10 12:57:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:57:37,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2022-01-10 12:57:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:37,211 INFO L225 Difference]: With dead ends: 6585 [2022-01-10 12:57:37,211 INFO L226 Difference]: Without dead ends: 4124 [2022-01-10 12:57:37,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:57:37,216 INFO L933 BasicCegarLoop]: 991 mSDtfsCounter, 1402 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:37,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 1786 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4124 states. [2022-01-10 12:57:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4124 to 2657. [2022-01-10 12:57:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2656 states have (on average 1.3859186746987953) internal successors, (3681), 2656 states have internal predecessors, (3681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3681 transitions. [2022-01-10 12:57:37,385 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3681 transitions. Word has length 156 [2022-01-10 12:57:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:37,385 INFO L470 AbstractCegarLoop]: Abstraction has 2657 states and 3681 transitions. [2022-01-10 12:57:37,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3681 transitions. [2022-01-10 12:57:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-10 12:57:37,388 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:37,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:37,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 12:57:37,389 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2005741820, now seen corresponding path program 1 times [2022-01-10 12:57:37,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:37,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555473469] [2022-01-10 12:57:37,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:37,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:37,461 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 12:57:37,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:37,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555473469] [2022-01-10 12:57:37,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555473469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:37,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:37,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:57:37,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65277945] [2022-01-10 12:57:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:37,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:57:37,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:37,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:57:37,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:57:37,462 INFO L87 Difference]: Start difference. First operand 2657 states and 3681 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:37,579 INFO L93 Difference]: Finished difference Result 4778 states and 6608 transitions. [2022-01-10 12:57:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:57:37,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2022-01-10 12:57:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:37,585 INFO L225 Difference]: With dead ends: 4778 [2022-01-10 12:57:37,585 INFO L226 Difference]: Without dead ends: 2157 [2022-01-10 12:57:37,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:57:37,588 INFO L933 BasicCegarLoop]: 471 mSDtfsCounter, 47 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:37,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1340 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2022-01-10 12:57:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2157. [2022-01-10 12:57:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2156 states have (on average 1.3803339517625233) internal successors, (2976), 2156 states have internal predecessors, (2976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 2976 transitions. [2022-01-10 12:57:37,723 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 2976 transitions. Word has length 156 [2022-01-10 12:57:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:37,723 INFO L470 AbstractCegarLoop]: Abstraction has 2157 states and 2976 transitions. [2022-01-10 12:57:37,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2976 transitions. [2022-01-10 12:57:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 12:57:37,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:37,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:37,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 12:57:37,726 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1613577135, now seen corresponding path program 1 times [2022-01-10 12:57:37,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:37,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132487535] [2022-01-10 12:57:37,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:37,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:37,786 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 12:57:37,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:37,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132487535] [2022-01-10 12:57:37,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132487535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:37,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:37,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:57:37,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584925961] [2022-01-10 12:57:37,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:37,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:57:37,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:37,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:57:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:57:37,788 INFO L87 Difference]: Start difference. First operand 2157 states and 2976 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:37,954 INFO L93 Difference]: Finished difference Result 4207 states and 5816 transitions. [2022-01-10 12:57:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:57:37,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2022-01-10 12:57:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:37,962 INFO L225 Difference]: With dead ends: 4207 [2022-01-10 12:57:37,962 INFO L226 Difference]: Without dead ends: 2966 [2022-01-10 12:57:37,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:37,966 INFO L933 BasicCegarLoop]: 739 mSDtfsCounter, 411 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:37,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 1162 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2022-01-10 12:57:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2157. [2022-01-10 12:57:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2156 states have (on average 1.3789424860853432) internal successors, (2973), 2156 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 2973 transitions. [2022-01-10 12:57:38,125 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 2973 transitions. Word has length 163 [2022-01-10 12:57:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:38,126 INFO L470 AbstractCegarLoop]: Abstraction has 2157 states and 2973 transitions. [2022-01-10 12:57:38,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 2973 transitions. [2022-01-10 12:57:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 12:57:38,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:38,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:38,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 12:57:38,130 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1526736413, now seen corresponding path program 1 times [2022-01-10 12:57:38,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:38,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129846955] [2022-01-10 12:57:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:38,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:38,258 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 12:57:38,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:38,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129846955] [2022-01-10 12:57:38,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129846955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:38,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:38,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:57:38,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901167695] [2022-01-10 12:57:38,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:38,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:57:38,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:38,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:57:38,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:57:38,259 INFO L87 Difference]: Start difference. First operand 2157 states and 2973 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:38,419 INFO L93 Difference]: Finished difference Result 4832 states and 6758 transitions. [2022-01-10 12:57:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:57:38,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-01-10 12:57:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:38,428 INFO L225 Difference]: With dead ends: 4832 [2022-01-10 12:57:38,428 INFO L226 Difference]: Without dead ends: 3290 [2022-01-10 12:57:38,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:38,430 INFO L933 BasicCegarLoop]: 797 mSDtfsCounter, 350 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:38,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 1187 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2022-01-10 12:57:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 3288. [2022-01-10 12:57:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3287 states have (on average 1.3659872223912382) internal successors, (4490), 3287 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4490 transitions. [2022-01-10 12:57:38,612 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4490 transitions. Word has length 164 [2022-01-10 12:57:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:38,613 INFO L470 AbstractCegarLoop]: Abstraction has 3288 states and 4490 transitions. [2022-01-10 12:57:38,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4490 transitions. [2022-01-10 12:57:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 12:57:38,617 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:38,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:38,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 12:57:38,617 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:38,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1478326464, now seen corresponding path program 1 times [2022-01-10 12:57:38,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:38,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434643054] [2022-01-10 12:57:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:38,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:38,722 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 12:57:38,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:38,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434643054] [2022-01-10 12:57:38,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434643054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:38,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:38,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:57:38,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143968473] [2022-01-10 12:57:38,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:38,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:57:38,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:38,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:57:38,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:57:38,723 INFO L87 Difference]: Start difference. First operand 3288 states and 4490 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:38,978 INFO L93 Difference]: Finished difference Result 7396 states and 10209 transitions. [2022-01-10 12:57:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:57:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-01-10 12:57:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:38,986 INFO L225 Difference]: With dead ends: 7396 [2022-01-10 12:57:38,986 INFO L226 Difference]: Without dead ends: 4993 [2022-01-10 12:57:38,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:38,989 INFO L933 BasicCegarLoop]: 791 mSDtfsCounter, 354 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:38,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 1181 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2022-01-10 12:57:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4991. [2022-01-10 12:57:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 4990 states have (on average 1.3492985971943887) internal successors, (6733), 4990 states have internal predecessors, (6733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 6733 transitions. [2022-01-10 12:57:39,252 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 6733 transitions. Word has length 164 [2022-01-10 12:57:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:39,253 INFO L470 AbstractCegarLoop]: Abstraction has 4991 states and 6733 transitions. [2022-01-10 12:57:39,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 6733 transitions. [2022-01-10 12:57:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-10 12:57:39,258 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:39,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:39,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 12:57:39,259 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -910785111, now seen corresponding path program 1 times [2022-01-10 12:57:39,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:39,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264877820] [2022-01-10 12:57:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:39,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:39,369 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 12:57:39,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:39,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264877820] [2022-01-10 12:57:39,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264877820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:39,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:39,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:57:39,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075249212] [2022-01-10 12:57:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:39,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:57:39,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:39,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:57:39,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:57:39,371 INFO L87 Difference]: Start difference. First operand 4991 states and 6733 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:40,426 INFO L93 Difference]: Finished difference Result 12877 states and 17688 transitions. [2022-01-10 12:57:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:57:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-01-10 12:57:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:40,442 INFO L225 Difference]: With dead ends: 12877 [2022-01-10 12:57:40,442 INFO L226 Difference]: Without dead ends: 9266 [2022-01-10 12:57:40,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:40,448 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 345 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:40,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 889 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 12:57:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9266 states. [2022-01-10 12:57:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9266 to 9264. [2022-01-10 12:57:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9264 states, 9263 states have (on average 1.3517219043506423) internal successors, (12521), 9263 states have internal predecessors, (12521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9264 states to 9264 states and 12521 transitions. [2022-01-10 12:57:40,999 INFO L78 Accepts]: Start accepts. Automaton has 9264 states and 12521 transitions. Word has length 170 [2022-01-10 12:57:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:40,999 INFO L470 AbstractCegarLoop]: Abstraction has 9264 states and 12521 transitions. [2022-01-10 12:57:40,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 9264 states and 12521 transitions. [2022-01-10 12:57:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-10 12:57:41,009 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:41,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:41,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 12:57:41,009 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:41,009 INFO L85 PathProgramCache]: Analyzing trace with hash -415028216, now seen corresponding path program 1 times [2022-01-10 12:57:41,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:41,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801107382] [2022-01-10 12:57:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:41,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:41,180 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 12:57:41,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:41,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801107382] [2022-01-10 12:57:41,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801107382] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:41,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:41,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:57:41,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974832279] [2022-01-10 12:57:41,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:41,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:57:41,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:41,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:57:41,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:57:41,183 INFO L87 Difference]: Start difference. First operand 9264 states and 12521 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:41,826 INFO L93 Difference]: Finished difference Result 18626 states and 25177 transitions. [2022-01-10 12:57:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:57:41,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-01-10 12:57:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:41,840 INFO L225 Difference]: With dead ends: 18626 [2022-01-10 12:57:41,841 INFO L226 Difference]: Without dead ends: 9515 [2022-01-10 12:57:41,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:57:41,849 INFO L933 BasicCegarLoop]: 693 mSDtfsCounter, 861 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:41,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 1077 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9515 states. [2022-01-10 12:57:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9515 to 9409. [2022-01-10 12:57:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9409 states, 9408 states have (on average 1.3478954081632653) internal successors, (12681), 9408 states have internal predecessors, (12681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 12681 transitions. [2022-01-10 12:57:42,555 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 12681 transitions. Word has length 170 [2022-01-10 12:57:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:42,556 INFO L470 AbstractCegarLoop]: Abstraction has 9409 states and 12681 transitions. [2022-01-10 12:57:42,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 12681 transitions. [2022-01-10 12:57:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-10 12:57:42,566 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:42,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:42,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 12:57:42,567 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:42,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:42,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1012014195, now seen corresponding path program 1 times [2022-01-10 12:57:42,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:42,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774841645] [2022-01-10 12:57:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:42,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:42,642 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 12:57:42,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:42,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774841645] [2022-01-10 12:57:42,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774841645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:42,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:42,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:57:42,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288765864] [2022-01-10 12:57:42,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:42,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:57:42,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:42,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:57:42,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:57:42,643 INFO L87 Difference]: Start difference. First operand 9409 states and 12681 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:43,763 INFO L93 Difference]: Finished difference Result 25202 states and 34104 transitions. [2022-01-10 12:57:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:57:43,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2022-01-10 12:57:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:43,792 INFO L225 Difference]: With dead ends: 25202 [2022-01-10 12:57:43,792 INFO L226 Difference]: Without dead ends: 18615 [2022-01-10 12:57:43,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:43,801 INFO L933 BasicCegarLoop]: 836 mSDtfsCounter, 404 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:43,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 1262 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18615 states. [2022-01-10 12:57:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18615 to 9419. [2022-01-10 12:57:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9419 states, 9418 states have (on average 1.3475260140157146) internal successors, (12691), 9418 states have internal predecessors, (12691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 12691 transitions. [2022-01-10 12:57:44,507 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 12691 transitions. Word has length 171 [2022-01-10 12:57:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:44,507 INFO L470 AbstractCegarLoop]: Abstraction has 9419 states and 12691 transitions. [2022-01-10 12:57:44,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 12691 transitions. [2022-01-10 12:57:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-10 12:57:44,517 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:44,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:44,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 12:57:44,517 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:44,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 487914435, now seen corresponding path program 1 times [2022-01-10 12:57:44,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13599436] [2022-01-10 12:57:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:44,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:44,677 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 12:57:44,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:44,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13599436] [2022-01-10 12:57:44,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13599436] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:44,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:44,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:57:44,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393987856] [2022-01-10 12:57:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:44,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:57:44,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:57:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:57:44,678 INFO L87 Difference]: Start difference. First operand 9419 states and 12691 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:46,002 INFO L93 Difference]: Finished difference Result 24231 states and 32658 transitions. [2022-01-10 12:57:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:57:46,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-01-10 12:57:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:46,028 INFO L225 Difference]: With dead ends: 24231 [2022-01-10 12:57:46,028 INFO L226 Difference]: Without dead ends: 15727 [2022-01-10 12:57:46,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:57:46,039 INFO L933 BasicCegarLoop]: 913 mSDtfsCounter, 1203 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:46,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1203 Valid, 2063 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:57:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15727 states. [2022-01-10 12:57:46,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15727 to 9724. [2022-01-10 12:57:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9724 states, 9723 states have (on average 1.3406356062943536) internal successors, (13035), 9723 states have internal predecessors, (13035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9724 states to 9724 states and 13035 transitions. [2022-01-10 12:57:46,792 INFO L78 Accepts]: Start accepts. Automaton has 9724 states and 13035 transitions. Word has length 172 [2022-01-10 12:57:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:46,793 INFO L470 AbstractCegarLoop]: Abstraction has 9724 states and 13035 transitions. [2022-01-10 12:57:46,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9724 states and 13035 transitions. [2022-01-10 12:57:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-10 12:57:46,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:46,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:46,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 12:57:46,802 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1352263719, now seen corresponding path program 1 times [2022-01-10 12:57:46,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:46,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151501960] [2022-01-10 12:57:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:46,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:46,890 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 12:57:46,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:46,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151501960] [2022-01-10 12:57:46,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151501960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:46,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:46,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:57:46,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933565704] [2022-01-10 12:57:46,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:46,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:57:46,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:57:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:57:46,891 INFO L87 Difference]: Start difference. First operand 9724 states and 13035 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:57:47,468 INFO L93 Difference]: Finished difference Result 15550 states and 20882 transitions. [2022-01-10 12:57:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:57:47,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-01-10 12:57:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:57:47,477 INFO L225 Difference]: With dead ends: 15550 [2022-01-10 12:57:47,478 INFO L226 Difference]: Without dead ends: 8416 [2022-01-10 12:57:47,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:57:47,486 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 23 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:57:47,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1313 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:57:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2022-01-10 12:57:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 8416. [2022-01-10 12:57:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8416 states, 8415 states have (on average 1.3389185977421272) internal successors, (11267), 8415 states have internal predecessors, (11267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 11267 transitions. [2022-01-10 12:57:48,126 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 11267 transitions. Word has length 172 [2022-01-10 12:57:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:57:48,126 INFO L470 AbstractCegarLoop]: Abstraction has 8416 states and 11267 transitions. [2022-01-10 12:57:48,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:57:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 11267 transitions. [2022-01-10 12:57:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-01-10 12:57:48,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:57:48,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:48,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 12:57:48,133 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:57:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:57:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash 415324574, now seen corresponding path program 1 times [2022-01-10 12:57:48,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:57:48,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557471067] [2022-01-10 12:57:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:57:48,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:57:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:57:52,812 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 12:57:52,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:57:52,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557471067] [2022-01-10 12:57:52,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557471067] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:57:52,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:57:52,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-10 12:57:52,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021623404] [2022-01-10 12:57:52,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:57:52,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 12:57:52,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:57:52,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 12:57:52,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-01-10 12:57:52,814 INFO L87 Difference]: Start difference. First operand 8416 states and 11267 transitions. Second operand has 24 states, 24 states have (on average 7.25) internal successors, (174), 24 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)