/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_NONE.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:19:43,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:19:43,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:19:43,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:19:43,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:19:43,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:19:43,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:19:43,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:19:43,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:19:43,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:19:43,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:19:43,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:19:43,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:19:43,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:19:43,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:19:43,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:19:43,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:19:43,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:19:43,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:19:43,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:19:43,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:19:43,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:19:43,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:19:43,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:19:43,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:19:43,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:19:43,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:19:43,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:19:43,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:19:43,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:19:43,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:19:43,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:19:43,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:19:43,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:19:43,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:19:43,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:19:43,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:19:43,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:19:43,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:19:43,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:19:43,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:19:43,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:19:43,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:19:43,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:19:43,945 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:19:43,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:19:43,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:19:43,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:19:43,946 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:19:43,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:19:43,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:19:43,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:19:43,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:19:43,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:19:43,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:19:43,947 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:19:43,947 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:19:43,947 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:19:43,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:19:43,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:19:43,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:19:43,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:19:43,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:19:43,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:19:43,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:19:43,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:19:43,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:19:43,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:19:43,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:19:43,948 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:19:43,948 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:19:43,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:19:43,949 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:19:43,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:19:43,950 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:19:43,950 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-11 00:19:44,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:19:44,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:19:44,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:19:44,159 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:19:44,160 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:19:44,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.15.cil.c [2022-01-11 00:19:44,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa859805d/641c58174b8b4bd79ae8fda9c9c8426a/FLAG57793d8e2 [2022-01-11 00:19:44,571 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:19:44,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.15.cil.c [2022-01-11 00:19:44,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa859805d/641c58174b8b4bd79ae8fda9c9c8426a/FLAG57793d8e2 [2022-01-11 00:19:44,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa859805d/641c58174b8b4bd79ae8fda9c9c8426a [2022-01-11 00:19:44,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:19:44,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:19:44,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:19:44,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:19:44,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:19:44,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:19:44" (1/1) ... [2022-01-11 00:19:44,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35fe3027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:44, skipping insertion in model container [2022-01-11 00:19:44,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:19:44" (1/1) ... [2022-01-11 00:19:44,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:19:45,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:19:45,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.15.cil.c[706,719] [2022-01-11 00:19:45,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:19:45,267 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:19:45,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.15.cil.c[706,719] [2022-01-11 00:19:45,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:19:45,342 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:19:45,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45 WrapperNode [2022-01-11 00:19:45,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:19:45,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:19:45,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:19:45,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:19:45,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,462 INFO L137 Inliner]: procedures = 54, calls = 69, calls flagged for inlining = 64, calls inlined = 286, statements flattened = 4413 [2022-01-11 00:19:45,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:19:45,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:19:45,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:19:45,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:19:45,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:19:45,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:19:45,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:19:45,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:19:45,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (1/1) ... [2022-01-11 00:19:45,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:19:45,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:19:45,620 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-11 00:19:45,628 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-11 00:19:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:19:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:19:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:19:45,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:19:45,767 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:19:45,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:19:47,531 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:19:47,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:19:47,549 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-01-11 00:19:47,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:47 BoogieIcfgContainer [2022-01-11 00:19:47,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:19:47,552 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:19:47,552 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:19:47,553 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:19:47,555 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:47" (1/1) ... [2022-01-11 00:19:47,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:19:47 BasicIcfg [2022-01-11 00:19:47,851 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:19:47,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:19:47,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:19:47,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:19:47,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:19:44" (1/4) ... [2022-01-11 00:19:47,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726f85bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:19:47, skipping insertion in model container [2022-01-11 00:19:47,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:45" (2/4) ... [2022-01-11 00:19:47,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726f85bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:19:47, skipping insertion in model container [2022-01-11 00:19:47,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:47" (3/4) ... [2022-01-11 00:19:47,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726f85bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:19:47, skipping insertion in model container [2022-01-11 00:19:47,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:19:47" (4/4) ... [2022-01-11 00:19:47,858 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.15.cil.cTransformedIcfg [2022-01-11 00:19:47,862 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:19:47,862 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:19:47,903 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:19:47,911 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-11 00:19:47,912 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:19:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 1921 states, 1919 states have (on average 1.4992183428869204) internal successors, (2877), 1920 states have internal predecessors, (2877), 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-11 00:19:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:47,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:47,962 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-11 00:19:47,962 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash -753134226, now seen corresponding path program 1 times [2022-01-11 00:19:47,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:47,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225686764] [2022-01-11 00:19:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:47,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:48,283 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-11 00:19:48,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:48,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225686764] [2022-01-11 00:19:48,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225686764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:48,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:48,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:48,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361586423] [2022-01-11 00:19:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:48,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:48,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:48,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,319 INFO L87 Difference]: Start difference. First operand has 1921 states, 1919 states have (on average 1.4992183428869204) internal successors, (2877), 1920 states have internal predecessors, (2877), 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 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:48,687 INFO L93 Difference]: Finished difference Result 5468 states and 8168 transitions. [2022-01-11 00:19:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:48,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:48,713 INFO L225 Difference]: With dead ends: 5468 [2022-01-11 00:19:48,713 INFO L226 Difference]: Without dead ends: 3559 [2022-01-11 00:19:48,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:48,725 INFO L933 BasicCegarLoop]: 2819 mSDtfsCounter, 2659 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 5340 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:48,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2659 Valid, 5340 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:48,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2022-01-11 00:19:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3557. [2022-01-11 00:19:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4701912260967378) internal successors, (5228), 3556 states have internal predecessors, (5228), 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-11 00:19:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5228 transitions. [2022-01-11 00:19:48,865 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5228 transitions. Word has length 171 [2022-01-11 00:19:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:48,866 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5228 transitions. [2022-01-11 00:19:48,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5228 transitions. [2022-01-11 00:19:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:48,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:48,873 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-11 00:19:48,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:19:48,874 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1304002035, now seen corresponding path program 1 times [2022-01-11 00:19:48,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:48,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680189721] [2022-01-11 00:19:48,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:48,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:48,976 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-11 00:19:48,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:48,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680189721] [2022-01-11 00:19:48,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680189721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:48,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:48,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:48,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016042921] [2022-01-11 00:19:48,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:48,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:48,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:48,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:48,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,980 INFO L87 Difference]: Start difference. First operand 3557 states and 5228 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:49,102 INFO L93 Difference]: Finished difference Result 7092 states and 10418 transitions. [2022-01-11 00:19:49,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:49,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:49,112 INFO L225 Difference]: With dead ends: 7092 [2022-01-11 00:19:49,113 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:49,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:49,122 INFO L933 BasicCegarLoop]: 2824 mSDtfsCounter, 2808 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2808 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:49,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2808 Valid, 2824 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.467941507311586) internal successors, (5220), 3556 states have internal predecessors, (5220), 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-11 00:19:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5220 transitions. [2022-01-11 00:19:49,214 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5220 transitions. Word has length 171 [2022-01-11 00:19:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:49,216 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5220 transitions. [2022-01-11 00:19:49,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5220 transitions. [2022-01-11 00:19:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:49,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:49,219 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-11 00:19:49,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:19:49,221 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:49,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:49,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2014701899, now seen corresponding path program 1 times [2022-01-11 00:19:49,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:49,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863145776] [2022-01-11 00:19:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:49,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:49,325 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-11 00:19:49,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:49,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863145776] [2022-01-11 00:19:49,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863145776] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:49,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:49,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:49,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864780748] [2022-01-11 00:19:49,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:49,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:49,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:49,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:49,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:49,327 INFO L87 Difference]: Start difference. First operand 3557 states and 5220 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:49,435 INFO L93 Difference]: Finished difference Result 7091 states and 10401 transitions. [2022-01-11 00:19:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:49,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:49,444 INFO L225 Difference]: With dead ends: 7091 [2022-01-11 00:19:49,445 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:49,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:49,449 INFO L933 BasicCegarLoop]: 2819 mSDtfsCounter, 2802 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2802 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:49,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2802 Valid, 2819 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4656917885264342) internal successors, (5212), 3556 states have internal predecessors, (5212), 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-11 00:19:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5212 transitions. [2022-01-11 00:19:49,552 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5212 transitions. Word has length 171 [2022-01-11 00:19:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:49,553 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5212 transitions. [2022-01-11 00:19:49,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5212 transitions. [2022-01-11 00:19:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:49,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:49,554 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-11 00:19:49,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:19:49,554 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1757568435, now seen corresponding path program 1 times [2022-01-11 00:19:49,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:49,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997147472] [2022-01-11 00:19:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:49,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:49,600 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-11 00:19:49,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:49,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997147472] [2022-01-11 00:19:49,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997147472] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:49,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:49,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:49,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928635719] [2022-01-11 00:19:49,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:49,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:49,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:49,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:49,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:49,602 INFO L87 Difference]: Start difference. First operand 3557 states and 5212 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:49,691 INFO L93 Difference]: Finished difference Result 7090 states and 10384 transitions. [2022-01-11 00:19:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:49,700 INFO L225 Difference]: With dead ends: 7090 [2022-01-11 00:19:49,700 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:49,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:49,710 INFO L933 BasicCegarLoop]: 2814 mSDtfsCounter, 2796 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2796 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:49,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2796 Valid, 2814 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4634420697412824) internal successors, (5204), 3556 states have internal predecessors, (5204), 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-11 00:19:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5204 transitions. [2022-01-11 00:19:49,816 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5204 transitions. Word has length 171 [2022-01-11 00:19:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:49,816 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5204 transitions. [2022-01-11 00:19:49,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5204 transitions. [2022-01-11 00:19:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:49,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:49,817 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-11 00:19:49,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:19:49,818 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash 60408075, now seen corresponding path program 1 times [2022-01-11 00:19:49,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:49,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296099946] [2022-01-11 00:19:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:49,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:49,897 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-11 00:19:49,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:49,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296099946] [2022-01-11 00:19:49,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296099946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:49,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:49,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:49,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547260629] [2022-01-11 00:19:49,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:49,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:49,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:49,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:49,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:49,899 INFO L87 Difference]: Start difference. First operand 3557 states and 5204 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:49,997 INFO L93 Difference]: Finished difference Result 7089 states and 10367 transitions. [2022-01-11 00:19:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:49,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:50,007 INFO L225 Difference]: With dead ends: 7089 [2022-01-11 00:19:50,008 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:50,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:50,013 INFO L933 BasicCegarLoop]: 2809 mSDtfsCounter, 2790 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2790 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:50,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2790 Valid, 2809 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4611923509561304) internal successors, (5196), 3556 states have internal predecessors, (5196), 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-11 00:19:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5196 transitions. [2022-01-11 00:19:50,156 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5196 transitions. Word has length 171 [2022-01-11 00:19:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:50,158 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5196 transitions. [2022-01-11 00:19:50,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5196 transitions. [2022-01-11 00:19:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:50,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:50,162 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-11 00:19:50,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:19:50,162 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1543515507, now seen corresponding path program 1 times [2022-01-11 00:19:50,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:50,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189372589] [2022-01-11 00:19:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:50,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:50,224 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-11 00:19:50,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:50,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189372589] [2022-01-11 00:19:50,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189372589] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:50,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:50,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:50,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513563444] [2022-01-11 00:19:50,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:50,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:50,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:50,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:50,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:50,225 INFO L87 Difference]: Start difference. First operand 3557 states and 5196 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:50,333 INFO L93 Difference]: Finished difference Result 7088 states and 10350 transitions. [2022-01-11 00:19:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:50,342 INFO L225 Difference]: With dead ends: 7088 [2022-01-11 00:19:50,343 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:50,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:50,347 INFO L933 BasicCegarLoop]: 2804 mSDtfsCounter, 2784 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2784 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:50,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2784 Valid, 2804 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:50,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4589426321709786) internal successors, (5188), 3556 states have internal predecessors, (5188), 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-11 00:19:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5188 transitions. [2022-01-11 00:19:50,465 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5188 transitions. Word has length 171 [2022-01-11 00:19:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:50,466 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5188 transitions. [2022-01-11 00:19:50,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5188 transitions. [2022-01-11 00:19:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:50,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:50,468 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-11 00:19:50,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:19:50,468 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1179612981, now seen corresponding path program 1 times [2022-01-11 00:19:50,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:50,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468896488] [2022-01-11 00:19:50,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:50,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:50,510 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-11 00:19:50,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:50,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468896488] [2022-01-11 00:19:50,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468896488] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:50,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:50,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:50,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250811320] [2022-01-11 00:19:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:50,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:50,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:50,512 INFO L87 Difference]: Start difference. First operand 3557 states and 5188 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:50,640 INFO L93 Difference]: Finished difference Result 7087 states and 10333 transitions. [2022-01-11 00:19:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:50,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:50,664 INFO L225 Difference]: With dead ends: 7087 [2022-01-11 00:19:50,664 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:50,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:50,671 INFO L933 BasicCegarLoop]: 2799 mSDtfsCounter, 2778 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2778 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:50,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2778 Valid, 2799 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4566929133858268) internal successors, (5180), 3556 states have internal predecessors, (5180), 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-11 00:19:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5180 transitions. [2022-01-11 00:19:50,793 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5180 transitions. Word has length 171 [2022-01-11 00:19:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:50,793 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5180 transitions. [2022-01-11 00:19:50,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5180 transitions. [2022-01-11 00:19:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:50,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:50,795 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-11 00:19:50,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:19:50,795 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1880167117, now seen corresponding path program 1 times [2022-01-11 00:19:50,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:50,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883533111] [2022-01-11 00:19:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:50,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:50,839 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-11 00:19:50,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:50,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883533111] [2022-01-11 00:19:50,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883533111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:50,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:50,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:50,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078116954] [2022-01-11 00:19:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:50,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:50,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:50,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:50,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:50,841 INFO L87 Difference]: Start difference. First operand 3557 states and 5180 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:50,959 INFO L93 Difference]: Finished difference Result 7086 states and 10316 transitions. [2022-01-11 00:19:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:50,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:50,966 INFO L225 Difference]: With dead ends: 7086 [2022-01-11 00:19:50,967 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:50,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:50,972 INFO L933 BasicCegarLoop]: 2794 mSDtfsCounter, 2772 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2772 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:50,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2772 Valid, 2794 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4544431946006748) internal successors, (5172), 3556 states have internal predecessors, (5172), 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-11 00:19:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5172 transitions. [2022-01-11 00:19:51,124 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5172 transitions. Word has length 171 [2022-01-11 00:19:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:51,124 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5172 transitions. [2022-01-11 00:19:51,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5172 transitions. [2022-01-11 00:19:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:51,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:51,126 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-11 00:19:51,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:19:51,126 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:51,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash 39207051, now seen corresponding path program 1 times [2022-01-11 00:19:51,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:51,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297617218] [2022-01-11 00:19:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:51,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:51,165 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-11 00:19:51,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:51,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297617218] [2022-01-11 00:19:51,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297617218] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:51,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:51,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:51,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058718754] [2022-01-11 00:19:51,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:51,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:51,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:51,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:51,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,168 INFO L87 Difference]: Start difference. First operand 3557 states and 5172 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:51,299 INFO L93 Difference]: Finished difference Result 7084 states and 10297 transitions. [2022-01-11 00:19:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:51,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:51,306 INFO L225 Difference]: With dead ends: 7084 [2022-01-11 00:19:51,306 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:51,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:51,313 INFO L933 BasicCegarLoop]: 2789 mSDtfsCounter, 2765 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2765 SdHoareTripleChecker+Valid, 2789 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:51,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2765 Valid, 2789 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.452193475815523) internal successors, (5164), 3556 states have internal predecessors, (5164), 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-11 00:19:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5164 transitions. [2022-01-11 00:19:51,431 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5164 transitions. Word has length 171 [2022-01-11 00:19:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:51,431 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5164 transitions. [2022-01-11 00:19:51,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5164 transitions. [2022-01-11 00:19:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:51,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:51,432 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-11 00:19:51,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:19:51,433 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1927792073, now seen corresponding path program 1 times [2022-01-11 00:19:51,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:51,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986690098] [2022-01-11 00:19:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:51,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:51,469 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-11 00:19:51,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:51,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986690098] [2022-01-11 00:19:51,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986690098] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:51,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:51,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:51,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603565616] [2022-01-11 00:19:51,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:51,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:51,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:51,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:51,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,470 INFO L87 Difference]: Start difference. First operand 3557 states and 5164 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:51,578 INFO L93 Difference]: Finished difference Result 7083 states and 10280 transitions. [2022-01-11 00:19:51,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:51,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:51,584 INFO L225 Difference]: With dead ends: 7083 [2022-01-11 00:19:51,585 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:51,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:51,590 INFO L933 BasicCegarLoop]: 2784 mSDtfsCounter, 2759 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2759 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:51,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2759 Valid, 2784 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4499437570303713) internal successors, (5156), 3556 states have internal predecessors, (5156), 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-11 00:19:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5156 transitions. [2022-01-11 00:19:51,709 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5156 transitions. Word has length 171 [2022-01-11 00:19:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:51,709 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5156 transitions. [2022-01-11 00:19:51,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5156 transitions. [2022-01-11 00:19:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:51,710 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:51,710 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-11 00:19:51,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:19:51,711 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1752063797, now seen corresponding path program 1 times [2022-01-11 00:19:51,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:51,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344506734] [2022-01-11 00:19:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:51,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:51,765 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-11 00:19:51,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344506734] [2022-01-11 00:19:51,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344506734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:51,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:51,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:51,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254714032] [2022-01-11 00:19:51,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:51,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:51,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:51,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:51,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,767 INFO L87 Difference]: Start difference. First operand 3557 states and 5156 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:51,874 INFO L93 Difference]: Finished difference Result 7082 states and 10263 transitions. [2022-01-11 00:19:51,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:51,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:51,881 INFO L225 Difference]: With dead ends: 7082 [2022-01-11 00:19:51,881 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:51,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:51,887 INFO L933 BasicCegarLoop]: 2779 mSDtfsCounter, 2753 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2753 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:51,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2753 Valid, 2779 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4476940382452193) internal successors, (5148), 3556 states have internal predecessors, (5148), 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-11 00:19:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5148 transitions. [2022-01-11 00:19:51,990 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5148 transitions. Word has length 171 [2022-01-11 00:19:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:51,991 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5148 transitions. [2022-01-11 00:19:51,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5148 transitions. [2022-01-11 00:19:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:51,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:51,992 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-11 00:19:51,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:19:51,992 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:51,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash 345988489, now seen corresponding path program 1 times [2022-01-11 00:19:51,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:51,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922976531] [2022-01-11 00:19:51,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:51,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:52,032 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-11 00:19:52,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:52,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922976531] [2022-01-11 00:19:52,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922976531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:52,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:52,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:52,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382952544] [2022-01-11 00:19:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:52,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:52,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:52,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:52,034 INFO L87 Difference]: Start difference. First operand 3557 states and 5148 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:52,168 INFO L93 Difference]: Finished difference Result 7081 states and 10246 transitions. [2022-01-11 00:19:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:52,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:52,175 INFO L225 Difference]: With dead ends: 7081 [2022-01-11 00:19:52,175 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:52,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:52,180 INFO L933 BasicCegarLoop]: 2774 mSDtfsCounter, 2747 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2747 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:52,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2747 Valid, 2774 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4454443194600675) internal successors, (5140), 3556 states have internal predecessors, (5140), 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-11 00:19:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5140 transitions. [2022-01-11 00:19:52,284 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5140 transitions. Word has length 171 [2022-01-11 00:19:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:52,284 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5140 transitions. [2022-01-11 00:19:52,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5140 transitions. [2022-01-11 00:19:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:52,286 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:52,286 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-11 00:19:52,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:19:52,286 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash 413667595, now seen corresponding path program 1 times [2022-01-11 00:19:52,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:52,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284119049] [2022-01-11 00:19:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:52,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:52,324 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-11 00:19:52,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:52,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284119049] [2022-01-11 00:19:52,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284119049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:52,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:52,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:52,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105071095] [2022-01-11 00:19:52,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:52,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:52,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:52,326 INFO L87 Difference]: Start difference. First operand 3557 states and 5140 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:52,475 INFO L93 Difference]: Finished difference Result 7080 states and 10229 transitions. [2022-01-11 00:19:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:52,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:52,482 INFO L225 Difference]: With dead ends: 7080 [2022-01-11 00:19:52,482 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:52,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:52,488 INFO L933 BasicCegarLoop]: 2739 mSDtfsCounter, 2584 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2584 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:52,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2584 Valid, 2877 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4353205849268842) internal successors, (5104), 3556 states have internal predecessors, (5104), 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-11 00:19:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5104 transitions. [2022-01-11 00:19:52,644 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5104 transitions. Word has length 171 [2022-01-11 00:19:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:52,644 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5104 transitions. [2022-01-11 00:19:52,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5104 transitions. [2022-01-11 00:19:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:52,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:52,645 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-11 00:19:52,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:19:52,646 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:52,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1028472554, now seen corresponding path program 1 times [2022-01-11 00:19:52,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:52,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954630436] [2022-01-11 00:19:52,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:52,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:52,681 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-11 00:19:52,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:52,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954630436] [2022-01-11 00:19:52,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954630436] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:52,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:52,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:52,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410220929] [2022-01-11 00:19:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:52,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:52,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:52,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:52,683 INFO L87 Difference]: Start difference. First operand 3557 states and 5104 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:52,833 INFO L93 Difference]: Finished difference Result 7079 states and 10156 transitions. [2022-01-11 00:19:52,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:52,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:52,840 INFO L225 Difference]: With dead ends: 7079 [2022-01-11 00:19:52,840 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:52,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:52,844 INFO L933 BasicCegarLoop]: 2719 mSDtfsCounter, 2564 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2564 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:52,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2564 Valid, 2856 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4251968503937007) internal successors, (5068), 3556 states have internal predecessors, (5068), 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-11 00:19:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5068 transitions. [2022-01-11 00:19:52,955 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5068 transitions. Word has length 171 [2022-01-11 00:19:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:52,955 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5068 transitions. [2022-01-11 00:19:52,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5068 transitions. [2022-01-11 00:19:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:52,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:52,956 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-11 00:19:52,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:19:52,957 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:52,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1869369677, now seen corresponding path program 1 times [2022-01-11 00:19:52,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:52,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672431191] [2022-01-11 00:19:52,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:52,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:52,996 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-11 00:19:52,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:52,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672431191] [2022-01-11 00:19:52,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672431191] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:52,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:52,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:52,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493599867] [2022-01-11 00:19:52,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:52,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:52,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:52,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:52,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:52,998 INFO L87 Difference]: Start difference. First operand 3557 states and 5068 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:53,191 INFO L93 Difference]: Finished difference Result 7078 states and 10083 transitions. [2022-01-11 00:19:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:53,198 INFO L225 Difference]: With dead ends: 7078 [2022-01-11 00:19:53,199 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:53,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:53,205 INFO L933 BasicCegarLoop]: 2699 mSDtfsCounter, 2544 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2544 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:53,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2544 Valid, 2835 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4150731158605174) internal successors, (5032), 3556 states have internal predecessors, (5032), 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-11 00:19:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5032 transitions. [2022-01-11 00:19:53,346 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5032 transitions. Word has length 171 [2022-01-11 00:19:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:53,346 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 5032 transitions. [2022-01-11 00:19:53,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5032 transitions. [2022-01-11 00:19:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:53,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:53,348 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-11 00:19:53,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:19:53,348 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:53,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1818107948, now seen corresponding path program 1 times [2022-01-11 00:19:53,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:53,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278851344] [2022-01-11 00:19:53,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:53,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:53,388 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-11 00:19:53,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:53,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278851344] [2022-01-11 00:19:53,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278851344] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:53,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:53,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:53,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641904486] [2022-01-11 00:19:53,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:53,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:53,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:53,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:53,391 INFO L87 Difference]: Start difference. First operand 3557 states and 5032 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:53,545 INFO L93 Difference]: Finished difference Result 7076 states and 10008 transitions. [2022-01-11 00:19:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:53,556 INFO L225 Difference]: With dead ends: 7076 [2022-01-11 00:19:53,556 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:53,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:53,562 INFO L933 BasicCegarLoop]: 2679 mSDtfsCounter, 2523 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2523 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:53,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2523 Valid, 2814 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:53,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.4049493813273342) internal successors, (4996), 3556 states have internal predecessors, (4996), 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-11 00:19:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4996 transitions. [2022-01-11 00:19:53,704 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4996 transitions. Word has length 171 [2022-01-11 00:19:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:53,705 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4996 transitions. [2022-01-11 00:19:53,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4996 transitions. [2022-01-11 00:19:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:53,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:53,706 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-11 00:19:53,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:19:53,706 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash -574181365, now seen corresponding path program 1 times [2022-01-11 00:19:53,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:53,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395148941] [2022-01-11 00:19:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:53,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:53,739 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-11 00:19:53,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:53,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395148941] [2022-01-11 00:19:53,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395148941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:53,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:53,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:53,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499885669] [2022-01-11 00:19:53,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:53,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:53,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:53,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:53,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:53,740 INFO L87 Difference]: Start difference. First operand 3557 states and 4996 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:53,885 INFO L93 Difference]: Finished difference Result 7075 states and 9935 transitions. [2022-01-11 00:19:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:53,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:53,892 INFO L225 Difference]: With dead ends: 7075 [2022-01-11 00:19:53,892 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:53,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:53,896 INFO L933 BasicCegarLoop]: 2659 mSDtfsCounter, 2503 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2503 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:53,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2503 Valid, 2793 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.3948256467941507) internal successors, (4960), 3556 states have internal predecessors, (4960), 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-11 00:19:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4960 transitions. [2022-01-11 00:19:54,012 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4960 transitions. Word has length 171 [2022-01-11 00:19:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:54,013 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4960 transitions. [2022-01-11 00:19:54,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4960 transitions. [2022-01-11 00:19:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:54,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:54,014 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-11 00:19:54,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:19:54,014 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 882763374, now seen corresponding path program 1 times [2022-01-11 00:19:54,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:54,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168422658] [2022-01-11 00:19:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:54,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:54,051 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-11 00:19:54,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:54,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168422658] [2022-01-11 00:19:54,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168422658] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:54,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:54,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:54,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957664727] [2022-01-11 00:19:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:54,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:54,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:54,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:54,053 INFO L87 Difference]: Start difference. First operand 3557 states and 4960 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:54,242 INFO L93 Difference]: Finished difference Result 7074 states and 9862 transitions. [2022-01-11 00:19:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:54,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:54,248 INFO L225 Difference]: With dead ends: 7074 [2022-01-11 00:19:54,248 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:54,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:54,251 INFO L933 BasicCegarLoop]: 2639 mSDtfsCounter, 2483 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2483 SdHoareTripleChecker+Valid, 2772 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:54,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2483 Valid, 2772 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.3847019122609674) internal successors, (4924), 3556 states have internal predecessors, (4924), 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-11 00:19:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4924 transitions. [2022-01-11 00:19:54,362 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4924 transitions. Word has length 171 [2022-01-11 00:19:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:54,362 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4924 transitions. [2022-01-11 00:19:54,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4924 transitions. [2022-01-11 00:19:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:54,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:54,363 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-11 00:19:54,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 00:19:54,364 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 343889741, now seen corresponding path program 1 times [2022-01-11 00:19:54,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:54,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391501511] [2022-01-11 00:19:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:54,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:54,395 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-11 00:19:54,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:54,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391501511] [2022-01-11 00:19:54,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391501511] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:54,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:54,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:54,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571330929] [2022-01-11 00:19:54,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:54,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:54,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:54,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:54,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:54,397 INFO L87 Difference]: Start difference. First operand 3557 states and 4924 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:54,545 INFO L93 Difference]: Finished difference Result 7073 states and 9789 transitions. [2022-01-11 00:19:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:54,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:54,553 INFO L225 Difference]: With dead ends: 7073 [2022-01-11 00:19:54,553 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:54,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:54,557 INFO L933 BasicCegarLoop]: 2619 mSDtfsCounter, 2463 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2463 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:54,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2463 Valid, 2751 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.3745781777277841) internal successors, (4888), 3556 states have internal predecessors, (4888), 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-11 00:19:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4888 transitions. [2022-01-11 00:19:54,676 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4888 transitions. Word has length 171 [2022-01-11 00:19:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:54,677 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4888 transitions. [2022-01-11 00:19:54,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4888 transitions. [2022-01-11 00:19:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:54,677 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:54,678 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-11 00:19:54,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 00:19:54,678 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2069901232, now seen corresponding path program 1 times [2022-01-11 00:19:54,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:54,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921342742] [2022-01-11 00:19:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:54,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:54,729 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-11 00:19:54,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:54,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921342742] [2022-01-11 00:19:54,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921342742] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:54,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:54,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:54,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169586106] [2022-01-11 00:19:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:54,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:54,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:54,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:54,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:54,730 INFO L87 Difference]: Start difference. First operand 3557 states and 4888 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:54,884 INFO L93 Difference]: Finished difference Result 7072 states and 9716 transitions. [2022-01-11 00:19:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:54,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:54,890 INFO L225 Difference]: With dead ends: 7072 [2022-01-11 00:19:54,890 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:54,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:54,893 INFO L933 BasicCegarLoop]: 2599 mSDtfsCounter, 2443 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2443 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:54,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2443 Valid, 2730 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.3644544431946006) internal successors, (4852), 3556 states have internal predecessors, (4852), 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-11 00:19:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4852 transitions. [2022-01-11 00:19:55,015 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4852 transitions. Word has length 171 [2022-01-11 00:19:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:55,015 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4852 transitions. [2022-01-11 00:19:55,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4852 transitions. [2022-01-11 00:19:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:55,016 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:55,016 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-11 00:19:55,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 00:19:55,016 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:55,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -275471985, now seen corresponding path program 1 times [2022-01-11 00:19:55,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:55,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329048189] [2022-01-11 00:19:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:55,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:55,048 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-11 00:19:55,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:55,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329048189] [2022-01-11 00:19:55,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329048189] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:55,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:55,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:55,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109769676] [2022-01-11 00:19:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:55,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:55,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:55,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:55,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:55,050 INFO L87 Difference]: Start difference. First operand 3557 states and 4852 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:55,256 INFO L93 Difference]: Finished difference Result 7071 states and 9643 transitions. [2022-01-11 00:19:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:55,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:55,262 INFO L225 Difference]: With dead ends: 7071 [2022-01-11 00:19:55,262 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:55,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:55,265 INFO L933 BasicCegarLoop]: 2579 mSDtfsCounter, 2423 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:55,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2423 Valid, 2709 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.3543307086614174) internal successors, (4816), 3556 states have internal predecessors, (4816), 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-11 00:19:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4816 transitions. [2022-01-11 00:19:55,443 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4816 transitions. Word has length 171 [2022-01-11 00:19:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:55,445 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4816 transitions. [2022-01-11 00:19:55,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4816 transitions. [2022-01-11 00:19:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:55,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:55,446 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-11 00:19:55,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 00:19:55,446 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:55,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1988264974, now seen corresponding path program 1 times [2022-01-11 00:19:55,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:55,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209962577] [2022-01-11 00:19:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:55,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:55,492 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-11 00:19:55,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:55,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209962577] [2022-01-11 00:19:55,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209962577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:55,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:55,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:55,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671028155] [2022-01-11 00:19:55,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:55,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:55,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:55,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:55,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:55,495 INFO L87 Difference]: Start difference. First operand 3557 states and 4816 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:55,708 INFO L93 Difference]: Finished difference Result 7070 states and 9570 transitions. [2022-01-11 00:19:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:55,713 INFO L225 Difference]: With dead ends: 7070 [2022-01-11 00:19:55,713 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:55,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:55,718 INFO L933 BasicCegarLoop]: 2559 mSDtfsCounter, 2403 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2403 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:55,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2403 Valid, 2688 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.3442069741282339) internal successors, (4780), 3556 states have internal predecessors, (4780), 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-11 00:19:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4780 transitions. [2022-01-11 00:19:55,871 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4780 transitions. Word has length 171 [2022-01-11 00:19:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:55,871 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4780 transitions. [2022-01-11 00:19:55,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4780 transitions. [2022-01-11 00:19:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:55,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:55,872 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-11 00:19:55,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 00:19:55,873 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash 834080465, now seen corresponding path program 1 times [2022-01-11 00:19:55,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:55,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795490629] [2022-01-11 00:19:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:55,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:55,908 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-11 00:19:55,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:55,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795490629] [2022-01-11 00:19:55,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795490629] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:55,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:55,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:55,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752329724] [2022-01-11 00:19:55,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:55,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:55,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:55,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:55,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:55,910 INFO L87 Difference]: Start difference. First operand 3557 states and 4780 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:56,111 INFO L93 Difference]: Finished difference Result 7068 states and 9495 transitions. [2022-01-11 00:19:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:56,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:56,116 INFO L225 Difference]: With dead ends: 7068 [2022-01-11 00:19:56,116 INFO L226 Difference]: Without dead ends: 3557 [2022-01-11 00:19:56,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:56,118 INFO L933 BasicCegarLoop]: 2539 mSDtfsCounter, 2382 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2382 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:56,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2382 Valid, 2667 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-01-11 00:19:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3557. [2022-01-11 00:19:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.3340832395950506) internal successors, (4744), 3556 states have internal predecessors, (4744), 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-11 00:19:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4744 transitions. [2022-01-11 00:19:56,248 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4744 transitions. Word has length 171 [2022-01-11 00:19:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:56,248 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4744 transitions. [2022-01-11 00:19:56,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4744 transitions. [2022-01-11 00:19:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:56,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:56,249 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-11 00:19:56,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 00:19:56,249 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash -176168272, now seen corresponding path program 1 times [2022-01-11 00:19:56,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:56,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518890466] [2022-01-11 00:19:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:56,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:56,315 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-11 00:19:56,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:56,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518890466] [2022-01-11 00:19:56,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518890466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:56,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:56,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:56,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773833745] [2022-01-11 00:19:56,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:56,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:56,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:56,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:56,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:56,318 INFO L87 Difference]: Start difference. First operand 3557 states and 4744 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 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-11 00:19:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:56,749 INFO L93 Difference]: Finished difference Result 8248 states and 11076 transitions. [2022-01-11 00:19:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:56,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 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-11 00:19:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:56,756 INFO L225 Difference]: With dead ends: 8248 [2022-01-11 00:19:56,756 INFO L226 Difference]: Without dead ends: 4751 [2022-01-11 00:19:56,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:19:56,762 INFO L933 BasicCegarLoop]: 2723 mSDtfsCounter, 7192 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7192 SdHoareTripleChecker+Valid, 5264 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:56,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7192 Valid, 5264 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4751 states. [2022-01-11 00:19:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4751 to 3563. [2022-01-11 00:19:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.325659741718136) internal successors, (4722), 3562 states have internal predecessors, (4722), 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-11 00:19:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4722 transitions. [2022-01-11 00:19:56,962 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4722 transitions. Word has length 171 [2022-01-11 00:19:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:56,962 INFO L470 AbstractCegarLoop]: Abstraction has 3563 states and 4722 transitions. [2022-01-11 00:19:56,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 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-11 00:19:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4722 transitions. [2022-01-11 00:19:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:56,963 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:56,963 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-11 00:19:56,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 00:19:56,963 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1322708785, now seen corresponding path program 1 times [2022-01-11 00:19:56,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:56,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092543323] [2022-01-11 00:19:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:56,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:57,001 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-11 00:19:57,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:57,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092543323] [2022-01-11 00:19:57,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092543323] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:57,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:57,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:57,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142214082] [2022-01-11 00:19:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:57,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:57,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:57,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:57,003 INFO L87 Difference]: Start difference. First operand 3563 states and 4722 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:57,400 INFO L93 Difference]: Finished difference Result 10208 states and 13517 transitions. [2022-01-11 00:19:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:57,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:57,411 INFO L225 Difference]: With dead ends: 10208 [2022-01-11 00:19:57,411 INFO L226 Difference]: Without dead ends: 6721 [2022-01-11 00:19:57,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:57,418 INFO L933 BasicCegarLoop]: 2525 mSDtfsCounter, 2292 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2292 SdHoareTripleChecker+Valid, 4810 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:57,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2292 Valid, 4810 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2022-01-11 00:19:57,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 6715. [2022-01-11 00:19:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6715 states, 6714 states have (on average 1.3199285075960678) internal successors, (8862), 6714 states have internal predecessors, (8862), 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-11 00:19:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 8862 transitions. [2022-01-11 00:19:57,776 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 8862 transitions. Word has length 171 [2022-01-11 00:19:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:57,776 INFO L470 AbstractCegarLoop]: Abstraction has 6715 states and 8862 transitions. [2022-01-11 00:19:57,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 8862 transitions. [2022-01-11 00:19:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:57,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:57,777 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-11 00:19:57,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 00:19:57,777 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1490403152, now seen corresponding path program 1 times [2022-01-11 00:19:57,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:57,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125185575] [2022-01-11 00:19:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:57,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:57,821 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-11 00:19:57,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:57,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125185575] [2022-01-11 00:19:57,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125185575] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:57,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:57,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:57,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963946116] [2022-01-11 00:19:57,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:57,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:57,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:57,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:57,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:57,823 INFO L87 Difference]: Start difference. First operand 6715 states and 8862 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 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-11 00:19:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:58,451 INFO L93 Difference]: Finished difference Result 17282 states and 22905 transitions. [2022-01-11 00:19:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:58,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 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-11 00:19:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:58,465 INFO L225 Difference]: With dead ends: 17282 [2022-01-11 00:19:58,465 INFO L226 Difference]: Without dead ends: 10661 [2022-01-11 00:19:58,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:19:58,475 INFO L933 BasicCegarLoop]: 2547 mSDtfsCounter, 6332 mSDsluCounter, 3779 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6332 SdHoareTripleChecker+Valid, 6326 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:58,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6332 Valid, 6326 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10661 states. [2022-01-11 00:19:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10661 to 6727. [2022-01-11 00:19:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6727 states, 6726 states have (on average 1.3114778471602735) internal successors, (8821), 6726 states have internal predecessors, (8821), 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-11 00:19:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6727 states to 6727 states and 8821 transitions. [2022-01-11 00:19:59,038 INFO L78 Accepts]: Start accepts. Automaton has 6727 states and 8821 transitions. Word has length 171 [2022-01-11 00:19:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:59,039 INFO L470 AbstractCegarLoop]: Abstraction has 6727 states and 8821 transitions. [2022-01-11 00:19:59,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 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-11 00:19:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6727 states and 8821 transitions. [2022-01-11 00:19:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:19:59,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:59,040 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-11 00:19:59,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 00:19:59,040 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash -282484977, now seen corresponding path program 1 times [2022-01-11 00:19:59,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:59,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342760879] [2022-01-11 00:19:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:59,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:59,093 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-11 00:19:59,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:59,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342760879] [2022-01-11 00:19:59,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342760879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:59,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:59,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:59,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520645306] [2022-01-11 00:19:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:59,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:59,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:59,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:59,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:59,095 INFO L87 Difference]: Start difference. First operand 6727 states and 8821 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:59,809 INFO L93 Difference]: Finished difference Result 19419 states and 25442 transitions. [2022-01-11 00:19:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:59,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:19:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:59,822 INFO L225 Difference]: With dead ends: 19419 [2022-01-11 00:19:59,822 INFO L226 Difference]: Without dead ends: 12823 [2022-01-11 00:19:59,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:59,827 INFO L933 BasicCegarLoop]: 2507 mSDtfsCounter, 2227 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 4778 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:59,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2227 Valid, 4778 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12823 states. [2022-01-11 00:20:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12823 to 12813. [2022-01-11 00:20:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12813 states, 12812 states have (on average 1.3054948485794569) internal successors, (16726), 12812 states have internal predecessors, (16726), 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-11 00:20:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12813 states to 12813 states and 16726 transitions. [2022-01-11 00:20:00,553 INFO L78 Accepts]: Start accepts. Automaton has 12813 states and 16726 transitions. Word has length 171 [2022-01-11 00:20:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:00,553 INFO L470 AbstractCegarLoop]: Abstraction has 12813 states and 16726 transitions. [2022-01-11 00:20:00,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12813 states and 16726 transitions. [2022-01-11 00:20:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:20:00,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:00,554 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-11 00:20:00,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 00:20:00,555 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:00,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:00,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1541901072, now seen corresponding path program 1 times [2022-01-11 00:20:00,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:00,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007967713] [2022-01-11 00:20:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:00,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:00,627 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-11 00:20:00,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007967713] [2022-01-11 00:20:00,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007967713] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:00,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:00,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:20:00,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573930065] [2022-01-11 00:20:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:00,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:00,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:00,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:00,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:00,629 INFO L87 Difference]: Start difference. First operand 12813 states and 16726 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:01,382 INFO L93 Difference]: Finished difference Result 25605 states and 33416 transitions. [2022-01-11 00:20:01,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:01,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:01,405 INFO L225 Difference]: With dead ends: 25605 [2022-01-11 00:20:01,405 INFO L226 Difference]: Without dead ends: 12813 [2022-01-11 00:20:01,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:20:01,424 INFO L933 BasicCegarLoop]: 2513 mSDtfsCounter, 2386 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2386 SdHoareTripleChecker+Valid, 2513 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:01,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2386 Valid, 2513 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12813 states. [2022-01-11 00:20:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12813 to 12813. [2022-01-11 00:20:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12813 states, 12812 states have (on average 1.3034655010927256) internal successors, (16700), 12812 states have internal predecessors, (16700), 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-11 00:20:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12813 states to 12813 states and 16700 transitions. [2022-01-11 00:20:02,245 INFO L78 Accepts]: Start accepts. Automaton has 12813 states and 16700 transitions. Word has length 171 [2022-01-11 00:20:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:02,245 INFO L470 AbstractCegarLoop]: Abstraction has 12813 states and 16700 transitions. [2022-01-11 00:20:02,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 12813 states and 16700 transitions. [2022-01-11 00:20:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:20:02,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:02,248 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-11 00:20:02,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 00:20:02,248 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1830382641, now seen corresponding path program 1 times [2022-01-11 00:20:02,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:02,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837722993] [2022-01-11 00:20:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:02,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:02,298 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-11 00:20:02,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:02,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837722993] [2022-01-11 00:20:02,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837722993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:02,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:02,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:20:02,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092672328] [2022-01-11 00:20:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:02,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:02,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:02,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:02,300 INFO L87 Difference]: Start difference. First operand 12813 states and 16700 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:03,194 INFO L93 Difference]: Finished difference Result 25597 states and 33356 transitions. [2022-01-11 00:20:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:03,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:03,211 INFO L225 Difference]: With dead ends: 25597 [2022-01-11 00:20:03,211 INFO L226 Difference]: Without dead ends: 12813 [2022-01-11 00:20:03,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:20:03,224 INFO L933 BasicCegarLoop]: 2508 mSDtfsCounter, 2373 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2373 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:03,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2373 Valid, 2508 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12813 states. [2022-01-11 00:20:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12813 to 12813. [2022-01-11 00:20:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12813 states, 12812 states have (on average 1.3014361536059944) internal successors, (16674), 12812 states have internal predecessors, (16674), 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-11 00:20:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12813 states to 12813 states and 16674 transitions. [2022-01-11 00:20:04,007 INFO L78 Accepts]: Start accepts. Automaton has 12813 states and 16674 transitions. Word has length 171 [2022-01-11 00:20:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:04,008 INFO L470 AbstractCegarLoop]: Abstraction has 12813 states and 16674 transitions. [2022-01-11 00:20:04,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12813 states and 16674 transitions. [2022-01-11 00:20:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:20:04,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:04,012 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-11 00:20:04,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 00:20:04,012 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2113784718, now seen corresponding path program 1 times [2022-01-11 00:20:04,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008846322] [2022-01-11 00:20:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:04,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:04,066 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-11 00:20:04,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:04,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008846322] [2022-01-11 00:20:04,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008846322] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:04,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:04,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:20:04,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040093641] [2022-01-11 00:20:04,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:04,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:04,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:04,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:04,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:04,068 INFO L87 Difference]: Start difference. First operand 12813 states and 16674 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:04,872 INFO L93 Difference]: Finished difference Result 25589 states and 33296 transitions. [2022-01-11 00:20:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:04,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:04,889 INFO L225 Difference]: With dead ends: 25589 [2022-01-11 00:20:04,889 INFO L226 Difference]: Without dead ends: 12813 [2022-01-11 00:20:04,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:20:04,897 INFO L933 BasicCegarLoop]: 2475 mSDtfsCounter, 2217 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2217 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:04,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2217 Valid, 2600 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12813 states. [2022-01-11 00:20:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12813 to 12813. [2022-01-11 00:20:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12813 states, 12812 states have (on average 1.2953481111458007) internal successors, (16596), 12812 states have internal predecessors, (16596), 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-11 00:20:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12813 states to 12813 states and 16596 transitions. [2022-01-11 00:20:05,693 INFO L78 Accepts]: Start accepts. Automaton has 12813 states and 16596 transitions. Word has length 171 [2022-01-11 00:20:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:05,693 INFO L470 AbstractCegarLoop]: Abstraction has 12813 states and 16596 transitions. [2022-01-11 00:20:05,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 12813 states and 16596 transitions. [2022-01-11 00:20:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:20:05,694 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:05,707 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-11 00:20:05,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 00:20:05,708 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -869020237, now seen corresponding path program 1 times [2022-01-11 00:20:05,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:05,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246389915] [2022-01-11 00:20:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:05,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:05,773 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-11 00:20:05,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:05,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246389915] [2022-01-11 00:20:05,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246389915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:05,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:05,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:20:05,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758578933] [2022-01-11 00:20:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:05,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:05,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:05,775 INFO L87 Difference]: Start difference. First operand 12813 states and 16596 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:06,598 INFO L93 Difference]: Finished difference Result 25581 states and 33132 transitions. [2022-01-11 00:20:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:06,618 INFO L225 Difference]: With dead ends: 25581 [2022-01-11 00:20:06,618 INFO L226 Difference]: Without dead ends: 12813 [2022-01-11 00:20:06,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:20:06,633 INFO L933 BasicCegarLoop]: 2456 mSDtfsCounter, 2191 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:06,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2191 Valid, 2580 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12813 states. [2022-01-11 00:20:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12813 to 12813. [2022-01-11 00:20:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12813 states, 12812 states have (on average 1.2892600686856073) internal successors, (16518), 12812 states have internal predecessors, (16518), 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-11 00:20:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12813 states to 12813 states and 16518 transitions. [2022-01-11 00:20:07,529 INFO L78 Accepts]: Start accepts. Automaton has 12813 states and 16518 transitions. Word has length 171 [2022-01-11 00:20:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:07,529 INFO L470 AbstractCegarLoop]: Abstraction has 12813 states and 16518 transitions. [2022-01-11 00:20:07,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 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-11 00:20:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 12813 states and 16518 transitions. [2022-01-11 00:20:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-11 00:20:07,530 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:07,530 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-11 00:20:07,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 00:20:07,530 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:07,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash 638531572, now seen corresponding path program 1 times [2022-01-11 00:20:07,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:07,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326743418] [2022-01-11 00:20:07,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:07,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:07,573 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-11 00:20:07,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:07,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326743418] [2022-01-11 00:20:07,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326743418] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:07,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:07,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:07,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455707748] [2022-01-11 00:20:07,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:07,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:07,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:07,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:07,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:07,574 INFO L87 Difference]: Start difference. First operand 12813 states and 16518 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-11 00:20:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:09,054 INFO L93 Difference]: Finished difference Result 37855 states and 48575 transitions. [2022-01-11 00:20:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:09,054 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-11 00:20:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:09,093 INFO L225 Difference]: With dead ends: 37855 [2022-01-11 00:20:09,093 INFO L226 Difference]: Without dead ends: 25213 [2022-01-11 00:20:09,113 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-11 00:20:09,114 INFO L933 BasicCegarLoop]: 2473 mSDtfsCounter, 2242 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2242 SdHoareTripleChecker+Valid, 4915 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:09,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2242 Valid, 4915 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25213 states. [2022-01-11 00:20:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25213 to 24435. [2022-01-11 00:20:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24435 states, 24434 states have (on average 1.2792420397806334) internal successors, (31257), 24434 states have internal predecessors, (31257), 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-11 00:20:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24435 states to 24435 states and 31257 transitions. [2022-01-11 00:20:10,647 INFO L78 Accepts]: Start accepts. Automaton has 24435 states and 31257 transitions. Word has length 171 [2022-01-11 00:20:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:10,647 INFO L470 AbstractCegarLoop]: Abstraction has 24435 states and 31257 transitions. [2022-01-11 00:20:10,647 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-11 00:20:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 24435 states and 31257 transitions. [2022-01-11 00:20:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 00:20:10,648 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:10,648 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-11 00:20:10,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 00:20:10,649 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:10,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1681312824, now seen corresponding path program 1 times [2022-01-11 00:20:10,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:10,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179160699] [2022-01-11 00:20:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:10,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:10,708 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-11 00:20:10,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:10,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179160699] [2022-01-11 00:20:10,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179160699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:10,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:10,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:20:10,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171208989] [2022-01-11 00:20:10,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:10,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:20:10,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:20:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:20:10,710 INFO L87 Difference]: Start difference. First operand 24435 states and 31257 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-11 00:20:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:14,024 INFO L93 Difference]: Finished difference Result 70641 states and 90496 transitions. [2022-01-11 00:20:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:20:14,025 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-11 00:20:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:14,100 INFO L225 Difference]: With dead ends: 70641 [2022-01-11 00:20:14,100 INFO L226 Difference]: Without dead ends: 46425 [2022-01-11 00:20:14,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:20:14,124 INFO L933 BasicCegarLoop]: 2723 mSDtfsCounter, 8832 mSDsluCounter, 10588 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8832 SdHoareTripleChecker+Valid, 13311 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:14,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8832 Valid, 13311 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:20:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46425 states. [2022-01-11 00:20:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46425 to 24759. [2022-01-11 00:20:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24759 states, 24758 states have (on average 1.2714678083851685) internal successors, (31479), 24758 states have internal predecessors, (31479), 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-11 00:20:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24759 states to 24759 states and 31479 transitions. [2022-01-11 00:20:16,125 INFO L78 Accepts]: Start accepts. Automaton has 24759 states and 31479 transitions. Word has length 172 [2022-01-11 00:20:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:16,125 INFO L470 AbstractCegarLoop]: Abstraction has 24759 states and 31479 transitions. [2022-01-11 00:20:16,126 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-11 00:20:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 24759 states and 31479 transitions. [2022-01-11 00:20:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 00:20:16,127 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:16,127 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-11 00:20:16,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 00:20:16,127 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash 710194377, now seen corresponding path program 1 times [2022-01-11 00:20:16,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:16,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514661817] [2022-01-11 00:20:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:16,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:16,173 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-11 00:20:16,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:16,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514661817] [2022-01-11 00:20:16,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514661817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:16,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:16,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:20:16,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175778170] [2022-01-11 00:20:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:16,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:20:16,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:16,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:20:16,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:20:16,175 INFO L87 Difference]: Start difference. First operand 24759 states and 31479 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-11 00:20:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:19,567 INFO L93 Difference]: Finished difference Result 60879 states and 77838 transitions. [2022-01-11 00:20:19,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:20:19,568 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-11 00:20:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:19,626 INFO L225 Difference]: With dead ends: 60879 [2022-01-11 00:20:19,626 INFO L226 Difference]: Without dead ends: 36263 [2022-01-11 00:20:19,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:20:19,646 INFO L933 BasicCegarLoop]: 2596 mSDtfsCounter, 6639 mSDsluCounter, 3192 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6639 SdHoareTripleChecker+Valid, 5788 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:19,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6639 Valid, 5788 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 00:20:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36263 states. [2022-01-11 00:20:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36263 to 24807. [2022-01-11 00:20:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24807 states, 24806 states have (on average 1.263121825364831) internal successors, (31333), 24806 states have internal predecessors, (31333), 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-11 00:20:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24807 states to 24807 states and 31333 transitions. [2022-01-11 00:20:21,749 INFO L78 Accepts]: Start accepts. Automaton has 24807 states and 31333 transitions. Word has length 172 [2022-01-11 00:20:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:21,749 INFO L470 AbstractCegarLoop]: Abstraction has 24807 states and 31333 transitions. [2022-01-11 00:20:21,750 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-11 00:20:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 24807 states and 31333 transitions. [2022-01-11 00:20:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 00:20:21,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:21,751 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-11 00:20:21,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 00:20:21,751 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1840981002, now seen corresponding path program 1 times [2022-01-11 00:20:21,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:21,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242321937] [2022-01-11 00:20:21,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:21,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:21,798 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-11 00:20:21,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:21,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242321937] [2022-01-11 00:20:21,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242321937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:21,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:21,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:20:21,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533873191] [2022-01-11 00:20:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:21,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:20:21,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:21,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:20:21,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:20:21,799 INFO L87 Difference]: Start difference. First operand 24807 states and 31333 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-11 00:20:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:24,819 INFO L93 Difference]: Finished difference Result 55991 states and 70914 transitions. [2022-01-11 00:20:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:20:24,820 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-11 00:20:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:24,857 INFO L225 Difference]: With dead ends: 55991 [2022-01-11 00:20:24,857 INFO L226 Difference]: Without dead ends: 31339 [2022-01-11 00:20:24,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:20:24,872 INFO L933 BasicCegarLoop]: 2396 mSDtfsCounter, 6537 mSDsluCounter, 3514 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6537 SdHoareTripleChecker+Valid, 5910 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:24,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6537 Valid, 5910 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:20:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31339 states. [2022-01-11 00:20:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31339 to 24831. [2022-01-11 00:20:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24831 states, 24830 states have (on average 1.2547321788159485) internal successors, (31155), 24830 states have internal predecessors, (31155), 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-11 00:20:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24831 states to 24831 states and 31155 transitions. [2022-01-11 00:20:27,180 INFO L78 Accepts]: Start accepts. Automaton has 24831 states and 31155 transitions. Word has length 172 [2022-01-11 00:20:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:27,180 INFO L470 AbstractCegarLoop]: Abstraction has 24831 states and 31155 transitions. [2022-01-11 00:20:27,180 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-11 00:20:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 24831 states and 31155 transitions. [2022-01-11 00:20:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 00:20:27,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:27,181 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-11 00:20:27,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 00:20:27,182 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:27,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1653450741, now seen corresponding path program 1 times [2022-01-11 00:20:27,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:27,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585995261] [2022-01-11 00:20:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:27,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:27,227 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-11 00:20:27,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:27,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585995261] [2022-01-11 00:20:27,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585995261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:27,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:27,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:20:27,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147039129] [2022-01-11 00:20:27,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:27,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:20:27,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:27,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:20:27,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:20:27,229 INFO L87 Difference]: Start difference. First operand 24831 states and 31155 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-11 00:20:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:30,654 INFO L93 Difference]: Finished difference Result 56665 states and 71270 transitions. [2022-01-11 00:20:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:20:30,654 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-11 00:20:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:30,690 INFO L225 Difference]: With dead ends: 56665 [2022-01-11 00:20:30,690 INFO L226 Difference]: Without dead ends: 32003 [2022-01-11 00:20:30,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:20:30,702 INFO L933 BasicCegarLoop]: 2530 mSDtfsCounter, 6263 mSDsluCounter, 3844 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6263 SdHoareTripleChecker+Valid, 6374 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:30,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6263 Valid, 6374 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:20:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32003 states. [2022-01-11 00:20:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32003 to 24855. [2022-01-11 00:20:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24855 states, 24854 states have (on average 1.2463587350124727) internal successors, (30977), 24854 states have internal predecessors, (30977), 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-11 00:20:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24855 states to 24855 states and 30977 transitions. [2022-01-11 00:20:33,235 INFO L78 Accepts]: Start accepts. Automaton has 24855 states and 30977 transitions. Word has length 172 [2022-01-11 00:20:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:33,235 INFO L470 AbstractCegarLoop]: Abstraction has 24855 states and 30977 transitions. [2022-01-11 00:20:33,235 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-11 00:20:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 24855 states and 30977 transitions. [2022-01-11 00:20:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 00:20:33,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:33,236 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-11 00:20:33,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 00:20:33,236 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:33,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1671225548, now seen corresponding path program 1 times [2022-01-11 00:20:33,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:33,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553457454] [2022-01-11 00:20:33,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:33,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:33,280 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-11 00:20:33,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:33,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553457454] [2022-01-11 00:20:33,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553457454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:33,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:33,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:20:33,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9991391] [2022-01-11 00:20:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:33,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:20:33,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:20:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:20:33,282 INFO L87 Difference]: Start difference. First operand 24855 states and 30977 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-11 00:20:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:37,447 INFO L93 Difference]: Finished difference Result 65785 states and 82134 transitions. [2022-01-11 00:20:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:20:37,447 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-11 00:20:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:37,499 INFO L225 Difference]: With dead ends: 65785 [2022-01-11 00:20:37,499 INFO L226 Difference]: Without dead ends: 41127 [2022-01-11 00:20:37,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:20:37,516 INFO L933 BasicCegarLoop]: 2481 mSDtfsCounter, 5926 mSDsluCounter, 4507 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5926 SdHoareTripleChecker+Valid, 6988 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:37,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5926 Valid, 6988 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:20:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41127 states. [2022-01-11 00:20:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41127 to 24903. [2022-01-11 00:20:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24903 states, 24902 states have (on average 1.2380933258372822) internal successors, (30831), 24902 states have internal predecessors, (30831), 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-11 00:20:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24903 states to 24903 states and 30831 transitions. [2022-01-11 00:20:40,387 INFO L78 Accepts]: Start accepts. Automaton has 24903 states and 30831 transitions. Word has length 172 [2022-01-11 00:20:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:40,388 INFO L470 AbstractCegarLoop]: Abstraction has 24903 states and 30831 transitions. [2022-01-11 00:20:40,388 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-11 00:20:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24903 states and 30831 transitions. [2022-01-11 00:20:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 00:20:40,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:40,389 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-11 00:20:40,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 00:20:40,389 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1791345421, now seen corresponding path program 1 times [2022-01-11 00:20:40,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:40,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251147689] [2022-01-11 00:20:40,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:40,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:40,435 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-11 00:20:40,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:40,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251147689] [2022-01-11 00:20:40,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251147689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:40,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:40,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:20:40,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225182566] [2022-01-11 00:20:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:40,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:20:40,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:40,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:20:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:20:40,437 INFO L87 Difference]: Start difference. First operand 24903 states and 30831 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-11 00:20:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:44,991 INFO L93 Difference]: Finished difference Result 67091 states and 83218 transitions. [2022-01-11 00:20:44,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:20:44,991 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-11 00:20:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:45,050 INFO L225 Difference]: With dead ends: 67091 [2022-01-11 00:20:45,050 INFO L226 Difference]: Without dead ends: 42399 [2022-01-11 00:20:45,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:20:45,075 INFO L933 BasicCegarLoop]: 2448 mSDtfsCounter, 5735 mSDsluCounter, 4836 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5735 SdHoareTripleChecker+Valid, 7284 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:45,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5735 Valid, 7284 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:20:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42399 states. [2022-01-11 00:20:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42399 to 24951. [2022-01-11 00:20:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24951 states, 24950 states have (on average 1.2298597194388778) internal successors, (30685), 24950 states have internal predecessors, (30685), 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-11 00:20:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24951 states to 24951 states and 30685 transitions. [2022-01-11 00:20:47,906 INFO L78 Accepts]: Start accepts. Automaton has 24951 states and 30685 transitions. Word has length 172 [2022-01-11 00:20:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:47,906 INFO L470 AbstractCegarLoop]: Abstraction has 24951 states and 30685 transitions. [2022-01-11 00:20:47,906 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-11 00:20:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 24951 states and 30685 transitions. [2022-01-11 00:20:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 00:20:47,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:47,907 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-11 00:20:47,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 00:20:47,907 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 835824142, now seen corresponding path program 1 times [2022-01-11 00:20:47,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:47,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606541663] [2022-01-11 00:20:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:47,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:47,957 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-11 00:20:47,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:47,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606541663] [2022-01-11 00:20:47,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606541663] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:47,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:47,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:20:47,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523133135] [2022-01-11 00:20:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:47,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:20:47,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:20:47,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:20:47,959 INFO L87 Difference]: Start difference. First operand 24951 states and 30685 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)