/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label25.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 10:10:40,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 10:10:40,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 10:10:40,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 10:10:40,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 10:10:40,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 10:10:40,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 10:10:40,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 10:10:40,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 10:10:40,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 10:10:40,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 10:10:40,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 10:10:40,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 10:10:40,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 10:10:40,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 10:10:40,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 10:10:40,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 10:10:40,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 10:10:40,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 10:10:40,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 10:10:40,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 10:10:40,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 10:10:40,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 10:10:40,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 10:10:40,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 10:10:40,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 10:10:40,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 10:10:40,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 10:10:40,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 10:10:40,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 10:10:40,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 10:10:40,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 10:10:40,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 10:10:40,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 10:10:40,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 10:10:40,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 10:10:40,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 10:10:40,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 10:10:40,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 10:10:40,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 10:10:40,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 10:10:40,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 10:10:40,477 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 10:10:40,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 10:10:40,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 10:10:40,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 10:10:40,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 10:10:40,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 10:10:40,479 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 10:10:40,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 10:10:40,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 10:10:40,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 10:10:40,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 10:10:40,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 10:10:40,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 10:10:40,481 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 10:10:40,481 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 10:10:40,481 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 10:10:40,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 10:10:40,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 10:10:40,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 10:10:40,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 10:10:40,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 10:10:40,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:10:40,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 10:10:40,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 10:10:40,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 10:10:40,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 10:10:40,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 10:10:40,483 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 10:10:40,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 10:10:40,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 10:10:40,483 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 10:10:40,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 10:10:40,484 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 10:10:40,484 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 10:10:40,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 10:10:40,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 10:10:40,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 10:10:40,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 10:10:40,649 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 10:10:40,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label25.c [2022-01-10 10:10:40,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06db87cb9/0dfe6a3663ad444a9669d272f2632d61/FLAGfc5c575e6 [2022-01-10 10:10:41,219 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 10:10:41,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label25.c [2022-01-10 10:10:41,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06db87cb9/0dfe6a3663ad444a9669d272f2632d61/FLAGfc5c575e6 [2022-01-10 10:10:41,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06db87cb9/0dfe6a3663ad444a9669d272f2632d61 [2022-01-10 10:10:41,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 10:10:41,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 10:10:41,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 10:10:41,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 10:10:41,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 10:10:41,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:10:41" (1/1) ... [2022-01-10 10:10:41,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc7bb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:41, skipping insertion in model container [2022-01-10 10:10:41,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:10:41" (1/1) ... [2022-01-10 10:10:41,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 10:10:41,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 10:10:42,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label25.c[58529,58542] [2022-01-10 10:10:42,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:10:42,295 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 10:10:42,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label25.c[58529,58542] [2022-01-10 10:10:42,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:10:42,452 INFO L208 MainTranslator]: Completed translation [2022-01-10 10:10:42,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42 WrapperNode [2022-01-10 10:10:42,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 10:10:42,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 10:10:42,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 10:10:42,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 10:10:42,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,552 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2022-01-10 10:10:42,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 10:10:42,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 10:10:42,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 10:10:42,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 10:10:42,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 10:10:42,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 10:10:42,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 10:10:42,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 10:10:42,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (1/1) ... [2022-01-10 10:10:42,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:10:42,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:10:42,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 10:10:42,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 10:10:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 10:10:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 10:10:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 10:10:42,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 10:10:42,774 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 10:10:42,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 10:10:44,153 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 10:10:44,160 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 10:10:44,160 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 10:10:44,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:10:44 BoogieIcfgContainer [2022-01-10 10:10:44,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 10:10:44,163 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 10:10:44,163 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 10:10:44,164 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 10:10:44,166 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:10:44" (1/1) ... [2022-01-10 10:10:44,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:10:44 BasicIcfg [2022-01-10 10:10:44,447 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 10:10:44,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 10:10:44,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 10:10:44,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 10:10:44,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 10:10:41" (1/4) ... [2022-01-10 10:10:44,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c7db9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:10:44, skipping insertion in model container [2022-01-10 10:10:44,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:10:42" (2/4) ... [2022-01-10 10:10:44,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c7db9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:10:44, skipping insertion in model container [2022-01-10 10:10:44,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:10:44" (3/4) ... [2022-01-10 10:10:44,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c7db9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:10:44, skipping insertion in model container [2022-01-10 10:10:44,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:10:44" (4/4) ... [2022-01-10 10:10:44,452 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem03_label25.cTransformedIcfg [2022-01-10 10:10:44,455 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 10:10:44,455 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 10:10:44,485 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 10:10:44,489 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 10:10:44,489 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 10:10:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-01-10 10:10:44,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:44,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:44,511 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:44,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash 471433566, now seen corresponding path program 1 times [2022-01-10 10:10:44,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:44,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547379903] [2022-01-10 10:10:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:44,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:10:45,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:45,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547379903] [2022-01-10 10:10:45,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547379903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:45,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:45,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:10:45,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742093016] [2022-01-10 10:10:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:45,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:10:45,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:10:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:45,128 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:46,151 INFO L93 Difference]: Finished difference Result 864 states and 1514 transitions. [2022-01-10 10:10:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:10:46,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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 180 [2022-01-10 10:10:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:46,166 INFO L225 Difference]: With dead ends: 864 [2022-01-10 10:10:46,166 INFO L226 Difference]: Without dead ends: 468 [2022-01-10 10:10:46,170 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-10 10:10:46,175 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 98 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:46,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 165 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 10:10:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-01-10 10:10:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454. [2022-01-10 10:10:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.6269315673289184) internal successors, (737), 453 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 737 transitions. [2022-01-10 10:10:46,220 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 737 transitions. Word has length 180 [2022-01-10 10:10:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:46,220 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 737 transitions. [2022-01-10 10:10:46,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 737 transitions. [2022-01-10 10:10:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-01-10 10:10:46,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:46,224 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:46,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 10:10:46,224 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:46,225 INFO L85 PathProgramCache]: Analyzing trace with hash 521067400, now seen corresponding path program 1 times [2022-01-10 10:10:46,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:46,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647562716] [2022-01-10 10:10:46,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:46,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:10:46,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:46,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647562716] [2022-01-10 10:10:46,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647562716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:46,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:46,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:10:46,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708093613] [2022-01-10 10:10:46,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:46,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:10:46,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:46,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:10:46,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:46,351 INFO L87 Difference]: Start difference. First operand 454 states and 737 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:46,691 INFO L93 Difference]: Finished difference Result 1345 states and 2190 transitions. [2022-01-10 10:10:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:10:46,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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 185 [2022-01-10 10:10:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:46,695 INFO L225 Difference]: With dead ends: 1345 [2022-01-10 10:10:46,695 INFO L226 Difference]: Without dead ends: 893 [2022-01-10 10:10:46,696 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-10 10:10:46,697 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 360 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:46,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 555 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 10:10:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-01-10 10:10:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 891. [2022-01-10 10:10:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.6258426966292134) internal successors, (1447), 890 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1447 transitions. [2022-01-10 10:10:46,721 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1447 transitions. Word has length 185 [2022-01-10 10:10:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:46,722 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 1447 transitions. [2022-01-10 10:10:46,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1447 transitions. [2022-01-10 10:10:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-10 10:10:46,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:46,726 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:46,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 10:10:46,726 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:46,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:46,727 INFO L85 PathProgramCache]: Analyzing trace with hash -400477467, now seen corresponding path program 1 times [2022-01-10 10:10:46,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:46,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671389777] [2022-01-10 10:10:46,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:46,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:10:46,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:46,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671389777] [2022-01-10 10:10:46,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671389777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:46,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:46,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:10:46,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236941790] [2022-01-10 10:10:46,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:46,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:10:46,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:10:46,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:46,828 INFO L87 Difference]: Start difference. First operand 891 states and 1447 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:47,734 INFO L93 Difference]: Finished difference Result 2620 states and 4271 transitions. [2022-01-10 10:10:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:10:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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 186 [2022-01-10 10:10:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:47,740 INFO L225 Difference]: With dead ends: 2620 [2022-01-10 10:10:47,740 INFO L226 Difference]: Without dead ends: 1731 [2022-01-10 10:10:47,741 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-10 10:10:47,742 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 252 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:47,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 162 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 10:10:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2022-01-10 10:10:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1726. [2022-01-10 10:10:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1725 states have (on average 1.5217391304347827) internal successors, (2625), 1725 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2625 transitions. [2022-01-10 10:10:47,804 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2625 transitions. Word has length 186 [2022-01-10 10:10:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:47,804 INFO L470 AbstractCegarLoop]: Abstraction has 1726 states and 2625 transitions. [2022-01-10 10:10:47,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2625 transitions. [2022-01-10 10:10:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-10 10:10:47,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:47,807 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:47,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 10:10:47,807 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1777827394, now seen corresponding path program 1 times [2022-01-10 10:10:47,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:47,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683484615] [2022-01-10 10:10:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:47,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:10:47,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:47,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683484615] [2022-01-10 10:10:47,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683484615] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:47,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:47,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:10:47,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047179268] [2022-01-10 10:10:47,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:47,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:10:47,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:10:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:47,890 INFO L87 Difference]: Start difference. First operand 1726 states and 2625 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:48,833 INFO L93 Difference]: Finished difference Result 5105 states and 7793 transitions. [2022-01-10 10:10:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:10:48,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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 188 [2022-01-10 10:10:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:48,843 INFO L225 Difference]: With dead ends: 5105 [2022-01-10 10:10:48,844 INFO L226 Difference]: Without dead ends: 3381 [2022-01-10 10:10:48,846 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-10 10:10:48,848 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:48,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 94 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 10:10:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2022-01-10 10:10:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3352. [2022-01-10 10:10:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3351 states have (on average 1.495971351835273) internal successors, (5013), 3351 states have internal predecessors, (5013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 5013 transitions. [2022-01-10 10:10:48,894 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 5013 transitions. Word has length 188 [2022-01-10 10:10:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:48,894 INFO L470 AbstractCegarLoop]: Abstraction has 3352 states and 5013 transitions. [2022-01-10 10:10:48,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 5013 transitions. [2022-01-10 10:10:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-10 10:10:48,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:48,899 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:48,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 10:10:48,899 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1584637020, now seen corresponding path program 1 times [2022-01-10 10:10:48,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:48,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767123181] [2022-01-10 10:10:48,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:48,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 10:10:49,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:49,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767123181] [2022-01-10 10:10:49,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767123181] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:49,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:49,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:10:49,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095286926] [2022-01-10 10:10:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:49,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:10:49,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:49,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:10:49,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:49,032 INFO L87 Difference]: Start difference. First operand 3352 states and 5013 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:49,930 INFO L93 Difference]: Finished difference Result 8343 states and 12434 transitions. [2022-01-10 10:10:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:10:49,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 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 197 [2022-01-10 10:10:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:49,944 INFO L225 Difference]: With dead ends: 8343 [2022-01-10 10:10:49,945 INFO L226 Difference]: Without dead ends: 4993 [2022-01-10 10:10:49,949 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-10 10:10:49,950 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 234 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:49,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 117 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 10:10:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2022-01-10 10:10:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4991. [2022-01-10 10:10:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 4990 states have (on average 1.4627254509018035) internal successors, (7299), 4990 states have internal predecessors, (7299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 7299 transitions. [2022-01-10 10:10:50,016 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 7299 transitions. Word has length 197 [2022-01-10 10:10:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:50,017 INFO L470 AbstractCegarLoop]: Abstraction has 4991 states and 7299 transitions. [2022-01-10 10:10:50,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 7299 transitions. [2022-01-10 10:10:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-10 10:10:50,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:50,023 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:50,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 10:10:50,023 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:50,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1243185672, now seen corresponding path program 1 times [2022-01-10 10:10:50,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:50,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328977941] [2022-01-10 10:10:50,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:50,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:10:50,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:50,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328977941] [2022-01-10 10:10:50,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328977941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:50,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:50,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:10:50,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148616423] [2022-01-10 10:10:50,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:50,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:10:50,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:50,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:10:50,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:50,118 INFO L87 Difference]: Start difference. First operand 4991 states and 7299 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:51,177 INFO L93 Difference]: Finished difference Result 14856 states and 21741 transitions. [2022-01-10 10:10:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:10:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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 199 [2022-01-10 10:10:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:51,205 INFO L225 Difference]: With dead ends: 14856 [2022-01-10 10:10:51,205 INFO L226 Difference]: Without dead ends: 9867 [2022-01-10 10:10:51,213 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-10 10:10:51,214 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 228 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:51,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 165 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 10:10:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2022-01-10 10:10:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9864. [2022-01-10 10:10:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9864 states, 9863 states have (on average 1.3184629423096421) internal successors, (13004), 9863 states have internal predecessors, (13004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 13004 transitions. [2022-01-10 10:10:51,365 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 13004 transitions. Word has length 199 [2022-01-10 10:10:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:51,365 INFO L470 AbstractCegarLoop]: Abstraction has 9864 states and 13004 transitions. [2022-01-10 10:10:51,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 13004 transitions. [2022-01-10 10:10:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-10 10:10:51,379 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:51,379 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:51,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 10:10:51,379 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:51,380 INFO L85 PathProgramCache]: Analyzing trace with hash 545087226, now seen corresponding path program 1 times [2022-01-10 10:10:51,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:51,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911978853] [2022-01-10 10:10:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:51,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 10:10:51,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:51,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911978853] [2022-01-10 10:10:51,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911978853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:51,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:51,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:10:51,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84374948] [2022-01-10 10:10:51,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:51,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:10:51,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:10:51,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:51,488 INFO L87 Difference]: Start difference. First operand 9864 states and 13004 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:52,542 INFO L93 Difference]: Finished difference Result 28667 states and 37818 transitions. [2022-01-10 10:10:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:10:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 202 [2022-01-10 10:10:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:52,585 INFO L225 Difference]: With dead ends: 28667 [2022-01-10 10:10:52,585 INFO L226 Difference]: Without dead ends: 18805 [2022-01-10 10:10:52,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:52,596 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 256 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:52,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 398 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 10:10:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18805 states. [2022-01-10 10:10:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18805 to 18803. [2022-01-10 10:10:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18803 states, 18802 states have (on average 1.2518349111796618) internal successors, (23537), 18802 states have internal predecessors, (23537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18803 states to 18803 states and 23537 transitions. [2022-01-10 10:10:52,849 INFO L78 Accepts]: Start accepts. Automaton has 18803 states and 23537 transitions. Word has length 202 [2022-01-10 10:10:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:52,849 INFO L470 AbstractCegarLoop]: Abstraction has 18803 states and 23537 transitions. [2022-01-10 10:10:52,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 18803 states and 23537 transitions. [2022-01-10 10:10:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-01-10 10:10:52,866 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:52,866 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:52,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 10:10:52,866 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2103218748, now seen corresponding path program 2 times [2022-01-10 10:10:52,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:52,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851556485] [2022-01-10 10:10:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:52,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 10:10:52,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:52,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851556485] [2022-01-10 10:10:52,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851556485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:52,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:52,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:10:52,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745032135] [2022-01-10 10:10:52,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:52,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:10:52,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:52,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:10:52,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:52,994 INFO L87 Difference]: Start difference. First operand 18803 states and 23537 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:53,905 INFO L93 Difference]: Finished difference Result 45525 states and 56065 transitions. [2022-01-10 10:10:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:10:53,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 204 [2022-01-10 10:10:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:53,950 INFO L225 Difference]: With dead ends: 45525 [2022-01-10 10:10:53,950 INFO L226 Difference]: Without dead ends: 26724 [2022-01-10 10:10:53,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:53,969 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 231 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:53,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 415 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 10:10:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26724 states. [2022-01-10 10:10:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26724 to 23878. [2022-01-10 10:10:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23878 states, 23877 states have (on average 1.2223478661473384) internal successors, (29186), 23877 states have internal predecessors, (29186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23878 states to 23878 states and 29186 transitions. [2022-01-10 10:10:54,261 INFO L78 Accepts]: Start accepts. Automaton has 23878 states and 29186 transitions. Word has length 204 [2022-01-10 10:10:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:54,263 INFO L470 AbstractCegarLoop]: Abstraction has 23878 states and 29186 transitions. [2022-01-10 10:10:54,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 23878 states and 29186 transitions. [2022-01-10 10:10:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-01-10 10:10:54,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:54,289 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:54,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 10:10:54,289 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1079731591, now seen corresponding path program 1 times [2022-01-10 10:10:54,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:54,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063445649] [2022-01-10 10:10:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:54,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 10:10:54,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063445649] [2022-01-10 10:10:54,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063445649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:54,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:54,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:10:54,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509926748] [2022-01-10 10:10:54,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:54,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:10:54,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:54,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:10:54,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:10:54,511 INFO L87 Difference]: Start difference. First operand 23878 states and 29186 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:55,673 INFO L93 Difference]: Finished difference Result 47756 states and 58374 transitions. [2022-01-10 10:10:55,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:10:55,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 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 229 [2022-01-10 10:10:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:55,705 INFO L225 Difference]: With dead ends: 47756 [2022-01-10 10:10:55,705 INFO L226 Difference]: Without dead ends: 23880 [2022-01-10 10:10:55,726 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-10 10:10:55,728 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 234 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:55,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 148 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 10:10:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23880 states. [2022-01-10 10:10:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23880 to 23472. [2022-01-10 10:10:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23472 states, 23471 states have (on average 1.1846534020706403) internal successors, (27805), 23471 states have internal predecessors, (27805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23472 states to 23472 states and 27805 transitions. [2022-01-10 10:10:56,103 INFO L78 Accepts]: Start accepts. Automaton has 23472 states and 27805 transitions. Word has length 229 [2022-01-10 10:10:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:56,104 INFO L470 AbstractCegarLoop]: Abstraction has 23472 states and 27805 transitions. [2022-01-10 10:10:56,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 23472 states and 27805 transitions. [2022-01-10 10:10:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-01-10 10:10:56,156 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:56,156 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:56,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 10:10:56,157 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:56,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2009785397, now seen corresponding path program 1 times [2022-01-10 10:10:56,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:56,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285840353] [2022-01-10 10:10:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:56,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 10:10:56,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:56,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285840353] [2022-01-10 10:10:56,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285840353] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:56,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:56,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:10:56,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984161003] [2022-01-10 10:10:56,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:56,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 10:10:56,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:56,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 10:10:56,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:10:56,324 INFO L87 Difference]: Start difference. First operand 23472 states and 27805 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:10:57,745 INFO L93 Difference]: Finished difference Result 83415 states and 99218 transitions. [2022-01-10 10:10:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 10:10:57,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 3 states have internal predecessors, (236), 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 247 [2022-01-10 10:10:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:10:57,867 INFO L225 Difference]: With dead ends: 83415 [2022-01-10 10:10:57,867 INFO L226 Difference]: Without dead ends: 59945 [2022-01-10 10:10:57,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:10:57,895 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 733 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:10:57,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 402 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 10:10:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59945 states. [2022-01-10 10:10:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59945 to 59938. [2022-01-10 10:10:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59938 states, 59937 states have (on average 1.1859619266896908) internal successors, (71083), 59937 states have internal predecessors, (71083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59938 states to 59938 states and 71083 transitions. [2022-01-10 10:10:59,050 INFO L78 Accepts]: Start accepts. Automaton has 59938 states and 71083 transitions. Word has length 247 [2022-01-10 10:10:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:10:59,051 INFO L470 AbstractCegarLoop]: Abstraction has 59938 states and 71083 transitions. [2022-01-10 10:10:59,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:10:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 59938 states and 71083 transitions. [2022-01-10 10:10:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-01-10 10:10:59,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:10:59,110 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:10:59,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 10:10:59,110 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:10:59,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:10:59,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1042828399, now seen corresponding path program 1 times [2022-01-10 10:10:59,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:10:59,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391155815] [2022-01-10 10:10:59,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:10:59,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:10:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:10:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 10:10:59,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:10:59,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391155815] [2022-01-10 10:10:59,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391155815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:10:59,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:10:59,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:10:59,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971799701] [2022-01-10 10:10:59,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:10:59,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 10:10:59,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:10:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 10:10:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:10:59,245 INFO L87 Difference]: Start difference. First operand 59938 states and 71083 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:11:01,363 INFO L93 Difference]: Finished difference Result 177794 states and 211152 transitions. [2022-01-10 10:11:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 10:11:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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 248 [2022-01-10 10:11:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:11:01,728 INFO L225 Difference]: With dead ends: 177794 [2022-01-10 10:11:01,728 INFO L226 Difference]: Without dead ends: 117858 [2022-01-10 10:11:01,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:11:01,767 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 573 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 10:11:01,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 563 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 10:11:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117858 states. [2022-01-10 10:11:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117858 to 116157. [2022-01-10 10:11:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116157 states, 116156 states have (on average 1.181841661214229) internal successors, (137278), 116156 states have internal predecessors, (137278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116157 states to 116157 states and 137278 transitions. [2022-01-10 10:11:03,593 INFO L78 Accepts]: Start accepts. Automaton has 116157 states and 137278 transitions. Word has length 248 [2022-01-10 10:11:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:11:03,593 INFO L470 AbstractCegarLoop]: Abstraction has 116157 states and 137278 transitions. [2022-01-10 10:11:03,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 116157 states and 137278 transitions. [2022-01-10 10:11:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-01-10 10:11:03,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:11:03,636 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:11:03,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 10:11:03,636 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:11:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:11:03,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1704403168, now seen corresponding path program 1 times [2022-01-10 10:11:03,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:11:03,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072715987] [2022-01-10 10:11:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:11:03,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:11:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:11:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-01-10 10:11:03,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:11:03,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072715987] [2022-01-10 10:11:03,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072715987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:11:03,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:11:03,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:11:03,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576380526] [2022-01-10 10:11:03,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:11:03,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 10:11:03,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:11:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 10:11:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:11:03,874 INFO L87 Difference]: Start difference. First operand 116157 states and 137278 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:11:05,823 INFO L93 Difference]: Finished difference Result 252033 states and 296255 transitions. [2022-01-10 10:11:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 10:11:05,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 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 271 [2022-01-10 10:11:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:11:06,055 INFO L225 Difference]: With dead ends: 252033 [2022-01-10 10:11:06,055 INFO L226 Difference]: Without dead ends: 135878 [2022-01-10 10:11:06,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:11:06,173 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 654 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:11:06,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 185 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 10:11:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135878 states. [2022-01-10 10:11:07,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135878 to 126307. [2022-01-10 10:11:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126307 states, 126306 states have (on average 1.1696514813231358) internal successors, (147734), 126306 states have internal predecessors, (147734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126307 states to 126307 states and 147734 transitions. [2022-01-10 10:11:08,266 INFO L78 Accepts]: Start accepts. Automaton has 126307 states and 147734 transitions. Word has length 271 [2022-01-10 10:11:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:11:08,266 INFO L470 AbstractCegarLoop]: Abstraction has 126307 states and 147734 transitions. [2022-01-10 10:11:08,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 126307 states and 147734 transitions. [2022-01-10 10:11:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-01-10 10:11:08,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:11:08,314 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:11:08,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 10:11:08,314 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:11:08,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:11:08,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1435856361, now seen corresponding path program 1 times [2022-01-10 10:11:08,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:11:08,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125325854] [2022-01-10 10:11:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:11:08,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:11:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:11:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-01-10 10:11:08,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:11:08,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125325854] [2022-01-10 10:11:08,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125325854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:11:08,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:11:08,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:11:08,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795700804] [2022-01-10 10:11:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:11:08,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:11:08,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:11:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:11:08,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:11:08,519 INFO L87 Difference]: Start difference. First operand 126307 states and 147734 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:11:10,659 INFO L93 Difference]: Finished difference Result 292657 states and 342458 transitions. [2022-01-10 10:11:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:11:10,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 280 [2022-01-10 10:11:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:11:10,879 INFO L225 Difference]: With dead ends: 292657 [2022-01-10 10:11:10,879 INFO L226 Difference]: Without dead ends: 166352 [2022-01-10 10:11:10,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:11:10,919 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:11:10,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 206 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 10:11:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166352 states. [2022-01-10 10:11:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166352 to 164307. [2022-01-10 10:11:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164307 states, 164306 states have (on average 1.159087312697041) internal successors, (190445), 164306 states have internal predecessors, (190445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164307 states to 164307 states and 190445 transitions. [2022-01-10 10:11:13,226 INFO L78 Accepts]: Start accepts. Automaton has 164307 states and 190445 transitions. Word has length 280 [2022-01-10 10:11:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:11:13,227 INFO L470 AbstractCegarLoop]: Abstraction has 164307 states and 190445 transitions. [2022-01-10 10:11:13,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 164307 states and 190445 transitions. [2022-01-10 10:11:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-01-10 10:11:13,546 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:11:13,546 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:11:13,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 10:11:13,546 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:11:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:11:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash 542094978, now seen corresponding path program 1 times [2022-01-10 10:11:13,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:11:13,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027888714] [2022-01-10 10:11:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:11:13,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:11:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:11:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 10:11:13,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:11:13,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027888714] [2022-01-10 10:11:13,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027888714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:11:13,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:11:13,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:11:13,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851104303] [2022-01-10 10:11:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:11:13,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 10:11:13,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:11:13,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 10:11:13,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:11:13,687 INFO L87 Difference]: Start difference. First operand 164307 states and 190445 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:11:17,148 INFO L93 Difference]: Finished difference Result 503738 states and 583545 transitions. [2022-01-10 10:11:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 10:11:17,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 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 281 [2022-01-10 10:11:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:11:17,737 INFO L225 Difference]: With dead ends: 503738 [2022-01-10 10:11:17,737 INFO L226 Difference]: Without dead ends: 339433 [2022-01-10 10:11:17,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:11:17,839 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 556 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-10 10:11:17,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 137 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-10 10:11:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339433 states. [2022-01-10 10:11:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339433 to 337374. [2022-01-10 10:11:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337374 states, 337373 states have (on average 1.1545766851526351) internal successors, (389523), 337373 states have internal predecessors, (389523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337374 states to 337374 states and 389523 transitions. [2022-01-10 10:11:23,360 INFO L78 Accepts]: Start accepts. Automaton has 337374 states and 389523 transitions. Word has length 281 [2022-01-10 10:11:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:11:23,360 INFO L470 AbstractCegarLoop]: Abstraction has 337374 states and 389523 transitions. [2022-01-10 10:11:23,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 337374 states and 389523 transitions. [2022-01-10 10:11:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-01-10 10:11:23,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:11:23,376 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:11:23,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 10:11:23,377 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:11:23,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:11:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash -564324603, now seen corresponding path program 1 times [2022-01-10 10:11:23,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:11:23,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134371205] [2022-01-10 10:11:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:11:23,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:11:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:11:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-01-10 10:11:23,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:11:23,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134371205] [2022-01-10 10:11:23,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134371205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:11:23,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:11:23,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:11:23,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381552339] [2022-01-10 10:11:23,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:11:23,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:11:23,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:11:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:11:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:11:23,485 INFO L87 Difference]: Start difference. First operand 337374 states and 389523 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:11:27,440 INFO L93 Difference]: Finished difference Result 755538 states and 871829 transitions. [2022-01-10 10:11:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:11:27,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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 282 [2022-01-10 10:11:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:11:28,288 INFO L225 Difference]: With dead ends: 755538 [2022-01-10 10:11:28,288 INFO L226 Difference]: Without dead ends: 418166 [2022-01-10 10:11:28,442 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-10 10:11:28,444 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 220 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 10:11:28,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 148 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 10:11:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418166 states. [2022-01-10 10:11:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418166 to 418151. [2022-01-10 10:11:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418151 states, 418150 states have (on average 1.1519741719478656) internal successors, (481698), 418150 states have internal predecessors, (481698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418151 states to 418151 states and 481698 transitions. [2022-01-10 10:11:36,718 INFO L78 Accepts]: Start accepts. Automaton has 418151 states and 481698 transitions. Word has length 282 [2022-01-10 10:11:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:11:36,719 INFO L470 AbstractCegarLoop]: Abstraction has 418151 states and 481698 transitions. [2022-01-10 10:11:36,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:11:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 418151 states and 481698 transitions. [2022-01-10 10:11:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-01-10 10:11:36,820 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:11:36,820 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:11:36,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 10:11:36,820 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:11:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:11:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1616523117, now seen corresponding path program 1 times [2022-01-10 10:11:36,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:11:36,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257630289] [2022-01-10 10:11:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:11:36,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:11:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:11:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-01-10 10:11:37,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:11:37,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257630289] [2022-01-10 10:11:37,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257630289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:11:37,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:11:37,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:11:37,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542623565] [2022-01-10 10:11:37,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:11:37,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 10:11:37,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:11:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 10:11:37,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:11:37,135 INFO L87 Difference]: Start difference. First operand 418151 states and 481698 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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)