/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.13.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:19:40,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:19:40,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:19:40,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:19:40,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:19:40,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:19:40,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:19:40,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:19:40,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:19:40,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:19:40,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:19:40,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:19:40,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:19:40,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:19:40,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:19:40,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:19:40,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:19:40,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:19:40,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:19:40,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:19:40,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:19:40,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:19:40,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:19:40,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:19:40,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:19:40,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:19:40,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:19:40,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:19:40,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:19:40,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:19:40,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:19:40,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:19:40,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:19:40,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:19:40,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:19:40,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:19:40,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:19:40,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:19:40,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:19:40,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:19:40,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:19:40,325 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:19:40,354 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:19:40,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:19:40,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:19:40,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:19:40,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:19:40,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:19:40,355 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:19:40,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:19:40,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:19:40,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:19:40,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:19:40,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:19:40,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:19:40,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:19:40,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:19:40,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:19:40,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:19:40,357 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:19:40,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:19:40,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:19:40,357 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:19:40,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:19:40,358 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:19:40,358 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 00:19:40,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:19:40,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:19:40,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:19:40,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:19:40,537 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:19:40,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.13.cil.c [2022-01-11 00:19:40,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5f71e1d/6a10244ee1aa41fb8a10a09bf10e5978/FLAG0b3b5fcbe [2022-01-11 00:19:40,957 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:19:40,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.13.cil.c [2022-01-11 00:19:40,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5f71e1d/6a10244ee1aa41fb8a10a09bf10e5978/FLAG0b3b5fcbe [2022-01-11 00:19:40,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5f71e1d/6a10244ee1aa41fb8a10a09bf10e5978 [2022-01-11 00:19:40,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:19:40,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:19:40,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:19:40,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:19:40,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:19:40,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:19:40" (1/1) ... [2022-01-11 00:19:40,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a91d933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:40, skipping insertion in model container [2022-01-11 00:19:40,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:19:40" (1/1) ... [2022-01-11 00:19:40,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:19:41,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:19:41,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.13.cil.c[706,719] [2022-01-11 00:19:41,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:19:41,335 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:19:41,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.13.cil.c[706,719] [2022-01-11 00:19:41,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:19:41,430 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:19:41,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41 WrapperNode [2022-01-11 00:19:41,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:19:41,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:19:41,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:19:41,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:19:41,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,560 INFO L137 Inliner]: procedures = 54, calls = 69, calls flagged for inlining = 64, calls inlined = 286, statements flattened = 4413 [2022-01-11 00:19:41,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:19:41,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:19:41,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:19:41,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:19:41,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:19:41,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:19:41,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:19:41,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:19:41,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (1/1) ... [2022-01-11 00:19:41,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:19:41,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:19:41,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 00:19:41,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 00:19:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:19:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:19:41,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:19:41,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:19:41,901 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:19:41,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:19:43,540 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:19:43,560 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:19:43,560 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-01-11 00:19:43,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:43 BoogieIcfgContainer [2022-01-11 00:19:43,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:19:43,565 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:19:43,565 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:19:43,566 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:19:43,568 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:43" (1/1) ... [2022-01-11 00:19:43,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:19:43 BasicIcfg [2022-01-11 00:19:43,930 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:19:43,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:19:43,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:19:43,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:19:43,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:19:40" (1/4) ... [2022-01-11 00:19:43,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac34bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:19:43, skipping insertion in model container [2022-01-11 00:19:43,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:41" (2/4) ... [2022-01-11 00:19:43,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac34bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:19:43, skipping insertion in model container [2022-01-11 00:19:43,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:43" (3/4) ... [2022-01-11 00:19:43,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac34bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:19:43, skipping insertion in model container [2022-01-11 00:19:43,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:19:43" (4/4) ... [2022-01-11 00:19:43,938 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.13.cil.cTransformedIcfg [2022-01-11 00:19:43,941 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:19:43,941 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:19:43,984 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:19:43,991 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 00:19:43,992 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:19:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 1922 states, 1920 states have (on average 1.4989583333333334) internal successors, (2878), 1921 states have internal predecessors, (2878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:44,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:44,042 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:44,043 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1269268163, now seen corresponding path program 1 times [2022-01-11 00:19:44,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:44,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154308554] [2022-01-11 00:19:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:44,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:44,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:44,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154308554] [2022-01-11 00:19:44,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154308554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:44,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:44,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:44,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448780907] [2022-01-11 00:19:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:44,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:44,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:44,414 INFO L87 Difference]: Start difference. First operand has 1922 states, 1920 states have (on average 1.4989583333333334) internal successors, (2878), 1921 states have internal predecessors, (2878), 0 states have call successors, (0), 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 62.0) internal successors, (186), 3 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-11 00:19:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:44,568 INFO L93 Difference]: Finished difference Result 3831 states and 5735 transitions. [2022-01-11 00:19:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:44,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 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-11 00:19:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:44,588 INFO L225 Difference]: With dead ends: 3831 [2022-01-11 00:19:44,588 INFO L226 Difference]: Without dead ends: 1917 [2022-01-11 00:19:44,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-11 00:19:44,601 INFO L933 BasicCegarLoop]: 2840 mSDtfsCounter, 2830 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2830 SdHoareTripleChecker+Valid, 2840 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:44,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2830 Valid, 2840 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-01-11 00:19:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1917. [2022-01-11 00:19:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1916 states have (on average 1.480688935281837) internal successors, (2837), 1916 states have internal predecessors, (2837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2837 transitions. [2022-01-11 00:19:44,696 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2837 transitions. Word has length 186 [2022-01-11 00:19:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:44,697 INFO L470 AbstractCegarLoop]: Abstraction has 1917 states and 2837 transitions. [2022-01-11 00:19:44,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 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-11 00:19:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2837 transitions. [2022-01-11 00:19:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:44,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:44,704 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:44,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:19:44,704 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:44,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1279038724, now seen corresponding path program 1 times [2022-01-11 00:19:44,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:44,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23131131] [2022-01-11 00:19:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:44,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:44,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:44,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23131131] [2022-01-11 00:19:44,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23131131] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:44,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:44,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:44,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145855222] [2022-01-11 00:19:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:44,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:44,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:44,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:44,841 INFO L87 Difference]: Start difference. First operand 1917 states and 2837 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-11 00:19:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:45,046 INFO L93 Difference]: Finished difference Result 5458 states and 8052 transitions. [2022-01-11 00:19:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:45,047 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-11 00:19:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:45,057 INFO L225 Difference]: With dead ends: 5458 [2022-01-11 00:19:45,057 INFO L226 Difference]: Without dead ends: 3561 [2022-01-11 00:19:45,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:45,064 INFO L933 BasicCegarLoop]: 2815 mSDtfsCounter, 2655 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2655 SdHoareTripleChecker+Valid, 5333 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:45,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2655 Valid, 5333 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2022-01-11 00:19:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3558. [2022-01-11 00:19:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.4697779027270172) internal successors, (5228), 3557 states have internal predecessors, (5228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5228 transitions. [2022-01-11 00:19:45,146 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5228 transitions. Word has length 186 [2022-01-11 00:19:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:45,147 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5228 transitions. [2022-01-11 00:19:45,147 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-11 00:19:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5228 transitions. [2022-01-11 00:19:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:45,150 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:45,151 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:45,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:19:45,154 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:45,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash -24359811, now seen corresponding path program 1 times [2022-01-11 00:19:45,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:45,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520398327] [2022-01-11 00:19:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:45,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:45,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:45,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520398327] [2022-01-11 00:19:45,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520398327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:45,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:45,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:45,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678979277] [2022-01-11 00:19:45,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:45,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:45,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:45,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:45,251 INFO L87 Difference]: Start difference. First operand 3558 states and 5228 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-11 00:19:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:45,354 INFO L93 Difference]: Finished difference Result 7095 states and 10421 transitions. [2022-01-11 00:19:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:45,355 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-11 00:19:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:45,364 INFO L225 Difference]: With dead ends: 7095 [2022-01-11 00:19:45,364 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:45,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:45,373 INFO L933 BasicCegarLoop]: 2824 mSDtfsCounter, 2809 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2809 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:45,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2809 Valid, 2824 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.46752881641833) internal successors, (5220), 3557 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5220 transitions. [2022-01-11 00:19:45,522 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5220 transitions. Word has length 186 [2022-01-11 00:19:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:45,522 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5220 transitions. [2022-01-11 00:19:45,522 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-11 00:19:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5220 transitions. [2022-01-11 00:19:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:45,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:45,524 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:45,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:19:45,524 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:45,525 INFO L85 PathProgramCache]: Analyzing trace with hash 668039099, now seen corresponding path program 1 times [2022-01-11 00:19:45,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:45,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950778593] [2022-01-11 00:19:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:45,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:45,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:45,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950778593] [2022-01-11 00:19:45,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950778593] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:45,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:45,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:45,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386781925] [2022-01-11 00:19:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:45,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:45,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:45,585 INFO L87 Difference]: Start difference. First operand 3558 states and 5220 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-11 00:19:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:45,699 INFO L93 Difference]: Finished difference Result 7094 states and 10404 transitions. [2022-01-11 00:19:45,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:45,700 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-11 00:19:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:45,708 INFO L225 Difference]: With dead ends: 7094 [2022-01-11 00:19:45,709 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:45,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:45,717 INFO L933 BasicCegarLoop]: 2819 mSDtfsCounter, 2803 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2803 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:45,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2803 Valid, 2819 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.465279730109643) internal successors, (5212), 3557 states have internal predecessors, (5212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5212 transitions. [2022-01-11 00:19:45,831 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5212 transitions. Word has length 186 [2022-01-11 00:19:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:45,831 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5212 transitions. [2022-01-11 00:19:45,831 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-11 00:19:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5212 transitions. [2022-01-11 00:19:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:45,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:45,833 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:45,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:19:45,834 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:45,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2075847869, now seen corresponding path program 1 times [2022-01-11 00:19:45,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:45,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329671876] [2022-01-11 00:19:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:45,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:45,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:45,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329671876] [2022-01-11 00:19:45,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329671876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:45,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:45,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:45,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806580476] [2022-01-11 00:19:45,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:45,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:45,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:45,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:45,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:45,906 INFO L87 Difference]: Start difference. First operand 3558 states and 5212 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-11 00:19:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:46,021 INFO L93 Difference]: Finished difference Result 7093 states and 10387 transitions. [2022-01-11 00:19:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:46,021 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-11 00:19:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:46,030 INFO L225 Difference]: With dead ends: 7093 [2022-01-11 00:19:46,030 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:46,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,035 INFO L933 BasicCegarLoop]: 2814 mSDtfsCounter, 2797 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2797 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:46,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2797 Valid, 2814 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:46,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.463030643800956) internal successors, (5204), 3557 states have internal predecessors, (5204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5204 transitions. [2022-01-11 00:19:46,130 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5204 transitions. Word has length 186 [2022-01-11 00:19:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:46,131 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5204 transitions. [2022-01-11 00:19:46,133 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-11 00:19:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5204 transitions. [2022-01-11 00:19:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:46,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:46,135 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:46,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:19:46,136 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:46,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1982713723, now seen corresponding path program 1 times [2022-01-11 00:19:46,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:46,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969155836] [2022-01-11 00:19:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:46,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:46,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:46,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969155836] [2022-01-11 00:19:46,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969155836] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:46,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:46,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:46,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680310886] [2022-01-11 00:19:46,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:46,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:46,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:46,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,208 INFO L87 Difference]: Start difference. First operand 3558 states and 5204 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-11 00:19:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:46,307 INFO L93 Difference]: Finished difference Result 7092 states and 10370 transitions. [2022-01-11 00:19:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:46,308 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-11 00:19:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:46,317 INFO L225 Difference]: With dead ends: 7092 [2022-01-11 00:19:46,317 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:46,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,323 INFO L933 BasicCegarLoop]: 2809 mSDtfsCounter, 2791 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2791 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:46,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2791 Valid, 2809 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.4607815574922687) internal successors, (5196), 3557 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5196 transitions. [2022-01-11 00:19:46,440 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5196 transitions. Word has length 186 [2022-01-11 00:19:46,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:46,440 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5196 transitions. [2022-01-11 00:19:46,441 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-11 00:19:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5196 transitions. [2022-01-11 00:19:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:46,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:46,442 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:46,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:19:46,443 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:46,443 INFO L85 PathProgramCache]: Analyzing trace with hash -929784579, now seen corresponding path program 1 times [2022-01-11 00:19:46,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:46,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032389259] [2022-01-11 00:19:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:46,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:46,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:46,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032389259] [2022-01-11 00:19:46,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032389259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:46,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:46,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:46,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775173088] [2022-01-11 00:19:46,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:46,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:46,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:46,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:46,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,486 INFO L87 Difference]: Start difference. First operand 3558 states and 5196 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-11 00:19:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:46,601 INFO L93 Difference]: Finished difference Result 7091 states and 10353 transitions. [2022-01-11 00:19:46,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:46,601 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-11 00:19:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:46,611 INFO L225 Difference]: With dead ends: 7091 [2022-01-11 00:19:46,611 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:46,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,616 INFO L933 BasicCegarLoop]: 2804 mSDtfsCounter, 2785 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2785 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:46,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2785 Valid, 2804 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.4585324711835816) internal successors, (5188), 3557 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5188 transitions. [2022-01-11 00:19:46,723 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5188 transitions. Word has length 186 [2022-01-11 00:19:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:46,724 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5188 transitions. [2022-01-11 00:19:46,725 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-11 00:19:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5188 transitions. [2022-01-11 00:19:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:46,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:46,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:46,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:19:46,726 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:46,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:46,727 INFO L85 PathProgramCache]: Analyzing trace with hash -885188805, now seen corresponding path program 1 times [2022-01-11 00:19:46,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:46,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809531108] [2022-01-11 00:19:46,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:46,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:46,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:46,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809531108] [2022-01-11 00:19:46,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809531108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:46,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:46,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:46,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116049396] [2022-01-11 00:19:46,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:46,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:46,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,786 INFO L87 Difference]: Start difference. First operand 3558 states and 5188 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-11 00:19:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:46,900 INFO L93 Difference]: Finished difference Result 7090 states and 10336 transitions. [2022-01-11 00:19:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:46,901 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-11 00:19:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:46,922 INFO L225 Difference]: With dead ends: 7090 [2022-01-11 00:19:46,922 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:46,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,945 INFO L933 BasicCegarLoop]: 2799 mSDtfsCounter, 2779 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:46,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2779 Valid, 2799 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:47,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.4562833848748946) internal successors, (5180), 3557 states have internal predecessors, (5180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5180 transitions. [2022-01-11 00:19:47,046 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5180 transitions. Word has length 186 [2022-01-11 00:19:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:47,046 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5180 transitions. [2022-01-11 00:19:47,047 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-11 00:19:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5180 transitions. [2022-01-11 00:19:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:47,048 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:47,048 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:47,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:19:47,048 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash -191013571, now seen corresponding path program 1 times [2022-01-11 00:19:47,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:47,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888007023] [2022-01-11 00:19:47,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:47,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:47,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:47,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888007023] [2022-01-11 00:19:47,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888007023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:47,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:47,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:47,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487244043] [2022-01-11 00:19:47,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:47,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:47,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,085 INFO L87 Difference]: Start difference. First operand 3558 states and 5180 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-11 00:19:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:47,191 INFO L93 Difference]: Finished difference Result 7089 states and 10319 transitions. [2022-01-11 00:19:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:47,192 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-11 00:19:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:47,198 INFO L225 Difference]: With dead ends: 7089 [2022-01-11 00:19:47,198 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:47,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,203 INFO L933 BasicCegarLoop]: 2794 mSDtfsCounter, 2773 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2773 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:47,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2773 Valid, 2794 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.4540342985662076) internal successors, (5172), 3557 states have internal predecessors, (5172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5172 transitions. [2022-01-11 00:19:47,335 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5172 transitions. Word has length 186 [2022-01-11 00:19:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:47,336 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5172 transitions. [2022-01-11 00:19:47,336 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-11 00:19:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5172 transitions. [2022-01-11 00:19:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:47,337 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:47,337 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:47,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:19:47,338 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:47,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash -584012516, now seen corresponding path program 1 times [2022-01-11 00:19:47,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:47,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465319990] [2022-01-11 00:19:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:47,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:47,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:47,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465319990] [2022-01-11 00:19:47,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465319990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:47,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:47,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:47,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612750952] [2022-01-11 00:19:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:47,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:47,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:47,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:47,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,375 INFO L87 Difference]: Start difference. First operand 3558 states and 5172 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-11 00:19:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:47,483 INFO L93 Difference]: Finished difference Result 7088 states and 10302 transitions. [2022-01-11 00:19:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:47,483 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-11 00:19:47,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:47,489 INFO L225 Difference]: With dead ends: 7088 [2022-01-11 00:19:47,489 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:47,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,494 INFO L933 BasicCegarLoop]: 2789 mSDtfsCounter, 2767 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2767 SdHoareTripleChecker+Valid, 2789 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:47,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2767 Valid, 2789 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.4517852122575203) internal successors, (5164), 3557 states have internal predecessors, (5164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5164 transitions. [2022-01-11 00:19:47,601 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5164 transitions. Word has length 186 [2022-01-11 00:19:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:47,601 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5164 transitions. [2022-01-11 00:19:47,601 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-11 00:19:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5164 transitions. [2022-01-11 00:19:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:47,602 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:47,603 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:47,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:19:47,603 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:47,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:47,603 INFO L85 PathProgramCache]: Analyzing trace with hash -426865762, now seen corresponding path program 1 times [2022-01-11 00:19:47,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:47,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031606503] [2022-01-11 00:19:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:47,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:47,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031606503] [2022-01-11 00:19:47,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031606503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:47,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:47,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:47,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341815621] [2022-01-11 00:19:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:47,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:47,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:47,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:47,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,639 INFO L87 Difference]: Start difference. First operand 3558 states and 5164 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-11 00:19:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:47,799 INFO L93 Difference]: Finished difference Result 7087 states and 10285 transitions. [2022-01-11 00:19:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:47,800 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-11 00:19:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:47,806 INFO L225 Difference]: With dead ends: 7087 [2022-01-11 00:19:47,806 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:47,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,811 INFO L933 BasicCegarLoop]: 2784 mSDtfsCounter, 2761 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2761 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:47,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2761 Valid, 2784 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.4495361259488333) internal successors, (5156), 3557 states have internal predecessors, (5156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5156 transitions. [2022-01-11 00:19:47,960 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5156 transitions. Word has length 186 [2022-01-11 00:19:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:47,960 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5156 transitions. [2022-01-11 00:19:47,961 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-11 00:19:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5156 transitions. [2022-01-11 00:19:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:47,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:47,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:47,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:19:47,963 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:47,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash -560343844, now seen corresponding path program 1 times [2022-01-11 00:19:47,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:47,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444260066] [2022-01-11 00:19:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:47,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:48,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:48,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444260066] [2022-01-11 00:19:48,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444260066] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:48,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:48,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:48,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875892875] [2022-01-11 00:19:48,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:48,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:48,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:48,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,008 INFO L87 Difference]: Start difference. First operand 3558 states and 5156 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-11 00:19:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:48,126 INFO L93 Difference]: Finished difference Result 7086 states and 10268 transitions. [2022-01-11 00:19:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:48,127 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-11 00:19:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:48,132 INFO L225 Difference]: With dead ends: 7086 [2022-01-11 00:19:48,132 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:48,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,138 INFO L933 BasicCegarLoop]: 2779 mSDtfsCounter, 2755 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2755 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:48,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2755 Valid, 2779 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.4472870396401463) internal successors, (5148), 3557 states have internal predecessors, (5148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5148 transitions. [2022-01-11 00:19:48,252 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5148 transitions. Word has length 186 [2022-01-11 00:19:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:48,252 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5148 transitions. [2022-01-11 00:19:48,252 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-11 00:19:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5148 transitions. [2022-01-11 00:19:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:48,253 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:48,253 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:48,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:19:48,254 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:48,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2088670242, now seen corresponding path program 1 times [2022-01-11 00:19:48,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:48,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159665108] [2022-01-11 00:19:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:48,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:48,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159665108] [2022-01-11 00:19:48,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159665108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:48,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:48,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:48,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091438101] [2022-01-11 00:19:48,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:48,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:48,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:48,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,295 INFO L87 Difference]: Start difference. First operand 3558 states and 5148 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-11 00:19:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:48,427 INFO L93 Difference]: Finished difference Result 7085 states and 10251 transitions. [2022-01-11 00:19:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:48,427 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-11 00:19:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:48,432 INFO L225 Difference]: With dead ends: 7085 [2022-01-11 00:19:48,432 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:48,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,437 INFO L933 BasicCegarLoop]: 2774 mSDtfsCounter, 2749 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2749 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:48,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2749 Valid, 2774 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.445037953331459) internal successors, (5140), 3557 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5140 transitions. [2022-01-11 00:19:48,547 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5140 transitions. Word has length 186 [2022-01-11 00:19:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:48,547 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5140 transitions. [2022-01-11 00:19:48,547 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-11 00:19:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5140 transitions. [2022-01-11 00:19:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:48,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:48,549 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:48,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:19:48,549 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash -475403108, now seen corresponding path program 1 times [2022-01-11 00:19:48,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:48,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232633268] [2022-01-11 00:19:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:48,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:48,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:48,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232633268] [2022-01-11 00:19:48,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232633268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:48,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:48,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:48,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742949934] [2022-01-11 00:19:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:48,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:48,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,593 INFO L87 Difference]: Start difference. First operand 3558 states and 5140 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-11 00:19:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:48,711 INFO L93 Difference]: Finished difference Result 7084 states and 10234 transitions. [2022-01-11 00:19:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:48,712 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-11 00:19:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:48,718 INFO L225 Difference]: With dead ends: 7084 [2022-01-11 00:19:48,718 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:48,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,724 INFO L933 BasicCegarLoop]: 2769 mSDtfsCounter, 2743 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2743 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:48,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2743 Valid, 2769 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.442788867022772) internal successors, (5132), 3557 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5132 transitions. [2022-01-11 00:19:48,897 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5132 transitions. Word has length 186 [2022-01-11 00:19:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:48,897 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5132 transitions. [2022-01-11 00:19:48,897 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-11 00:19:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5132 transitions. [2022-01-11 00:19:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:48,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:48,898 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:48,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:19:48,898 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1808835554, now seen corresponding path program 1 times [2022-01-11 00:19:48,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:48,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304699254] [2022-01-11 00:19:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:48,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:48,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:48,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304699254] [2022-01-11 00:19:48,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304699254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:48,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:48,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:48,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306910358] [2022-01-11 00:19:48,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:48,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:48,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:48,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:48,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,941 INFO L87 Difference]: Start difference. First operand 3558 states and 5132 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-11 00:19:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:49,057 INFO L93 Difference]: Finished difference Result 7083 states and 10217 transitions. [2022-01-11 00:19:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:49,057 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-11 00:19:49,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:49,064 INFO L225 Difference]: With dead ends: 7083 [2022-01-11 00:19:49,064 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:49,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:49,070 INFO L933 BasicCegarLoop]: 2764 mSDtfsCounter, 2737 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:49,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2737 Valid, 2764 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.440539780714085) internal successors, (5124), 3557 states have internal predecessors, (5124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5124 transitions. [2022-01-11 00:19:49,199 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5124 transitions. Word has length 186 [2022-01-11 00:19:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:49,199 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5124 transitions. [2022-01-11 00:19:49,200 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-11 00:19:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5124 transitions. [2022-01-11 00:19:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:49,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:49,201 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:49,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:19:49,201 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1990396836, now seen corresponding path program 1 times [2022-01-11 00:19:49,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:49,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432357037] [2022-01-11 00:19:49,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:49,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:49,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:49,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432357037] [2022-01-11 00:19:49,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432357037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:49,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:49,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:49,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791095972] [2022-01-11 00:19:49,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:49,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:49,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:49,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:49,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:49,248 INFO L87 Difference]: Start difference. First operand 3558 states and 5124 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-11 00:19:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:49,448 INFO L93 Difference]: Finished difference Result 7082 states and 10200 transitions. [2022-01-11 00:19:49,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:49,448 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-11 00:19:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:49,454 INFO L225 Difference]: With dead ends: 7082 [2022-01-11 00:19:49,455 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:49,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:49,458 INFO L933 BasicCegarLoop]: 2729 mSDtfsCounter, 2574 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 2867 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:49,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2574 Valid, 2867 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.430418892324993) internal successors, (5088), 3557 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5088 transitions. [2022-01-11 00:19:49,584 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5088 transitions. Word has length 186 [2022-01-11 00:19:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:49,584 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5088 transitions. [2022-01-11 00:19:49,585 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-11 00:19:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5088 transitions. [2022-01-11 00:19:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:49,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:49,586 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:49,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:19:49,586 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash -333685666, now seen corresponding path program 1 times [2022-01-11 00:19:49,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:49,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392364417] [2022-01-11 00:19:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:49,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:49,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:49,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392364417] [2022-01-11 00:19:49,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392364417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:49,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:49,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:49,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557070141] [2022-01-11 00:19:49,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:49,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:49,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:49,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:49,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:49,623 INFO L87 Difference]: Start difference. First operand 3558 states and 5088 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-11 00:19:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:49,773 INFO L93 Difference]: Finished difference Result 7081 states and 10127 transitions. [2022-01-11 00:19:49,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:49,774 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-11 00:19:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:49,779 INFO L225 Difference]: With dead ends: 7081 [2022-01-11 00:19:49,780 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:49,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:49,784 INFO L933 BasicCegarLoop]: 2709 mSDtfsCounter, 2554 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2554 SdHoareTripleChecker+Valid, 2846 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:49,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2554 Valid, 2846 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.420298003935901) internal successors, (5052), 3557 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5052 transitions. [2022-01-11 00:19:49,965 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5052 transitions. Word has length 186 [2022-01-11 00:19:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:49,965 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5052 transitions. [2022-01-11 00:19:49,965 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-11 00:19:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5052 transitions. [2022-01-11 00:19:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:49,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:49,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:49,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:19:49,967 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2114053820, now seen corresponding path program 1 times [2022-01-11 00:19:49,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:49,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120460465] [2022-01-11 00:19:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:49,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:50,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:50,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120460465] [2022-01-11 00:19:50,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120460465] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:50,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:50,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:50,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532568243] [2022-01-11 00:19:50,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:50,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:50,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:50,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:50,027 INFO L87 Difference]: Start difference. First operand 3558 states and 5052 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-11 00:19:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:50,262 INFO L93 Difference]: Finished difference Result 7080 states and 10054 transitions. [2022-01-11 00:19:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:50,262 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-11 00:19:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:50,269 INFO L225 Difference]: With dead ends: 7080 [2022-01-11 00:19:50,269 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:50,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:50,274 INFO L933 BasicCegarLoop]: 2689 mSDtfsCounter, 2534 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:50,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2534 Valid, 2825 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.410177115546809) internal successors, (5016), 3557 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5016 transitions. [2022-01-11 00:19:50,530 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5016 transitions. Word has length 186 [2022-01-11 00:19:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:50,530 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 5016 transitions. [2022-01-11 00:19:50,530 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-11 00:19:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5016 transitions. [2022-01-11 00:19:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:50,532 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:50,532 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:50,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 00:19:50,532 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:50,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:50,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1081434627, now seen corresponding path program 1 times [2022-01-11 00:19:50,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:50,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325735935] [2022-01-11 00:19:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:50,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:50,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:50,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325735935] [2022-01-11 00:19:50,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325735935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:50,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:50,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:50,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396579796] [2022-01-11 00:19:50,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:50,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:50,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:50,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:50,568 INFO L87 Difference]: Start difference. First operand 3558 states and 5016 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-11 00:19:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:50,773 INFO L93 Difference]: Finished difference Result 7079 states and 9981 transitions. [2022-01-11 00:19:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:50,773 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-11 00:19:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:50,780 INFO L225 Difference]: With dead ends: 7079 [2022-01-11 00:19:50,781 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:50,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:50,786 INFO L933 BasicCegarLoop]: 2669 mSDtfsCounter, 2514 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2514 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:50,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2514 Valid, 2804 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.4000562271577173) internal successors, (4980), 3557 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4980 transitions. [2022-01-11 00:19:50,969 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4980 transitions. Word has length 186 [2022-01-11 00:19:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:50,969 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4980 transitions. [2022-01-11 00:19:50,969 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-11 00:19:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4980 transitions. [2022-01-11 00:19:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:50,971 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:50,971 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:50,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 00:19:50,971 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1238829254, now seen corresponding path program 1 times [2022-01-11 00:19:50,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:50,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983229883] [2022-01-11 00:19:50,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:50,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:51,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:51,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983229883] [2022-01-11 00:19:51,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983229883] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:51,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:51,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:51,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079457811] [2022-01-11 00:19:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:51,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:51,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:51,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:51,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,007 INFO L87 Difference]: Start difference. First operand 3558 states and 4980 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-11 00:19:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:51,177 INFO L93 Difference]: Finished difference Result 7078 states and 9908 transitions. [2022-01-11 00:19:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:51,178 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-11 00:19:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:51,185 INFO L225 Difference]: With dead ends: 7078 [2022-01-11 00:19:51,185 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:51,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,190 INFO L933 BasicCegarLoop]: 2649 mSDtfsCounter, 2494 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:51,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2494 Valid, 2783 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.3899353387686253) internal successors, (4944), 3557 states have internal predecessors, (4944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4944 transitions. [2022-01-11 00:19:51,339 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4944 transitions. Word has length 186 [2022-01-11 00:19:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:51,339 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4944 transitions. [2022-01-11 00:19:51,339 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-11 00:19:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4944 transitions. [2022-01-11 00:19:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:51,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:51,341 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:51,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 00:19:51,341 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1086377339, now seen corresponding path program 1 times [2022-01-11 00:19:51,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:51,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244539213] [2022-01-11 00:19:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:51,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:51,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:51,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244539213] [2022-01-11 00:19:51,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244539213] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:51,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:51,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:51,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004520225] [2022-01-11 00:19:51,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:51,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:51,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:51,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,375 INFO L87 Difference]: Start difference. First operand 3558 states and 4944 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-11 00:19:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:51,526 INFO L93 Difference]: Finished difference Result 7077 states and 9835 transitions. [2022-01-11 00:19:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:51,527 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-11 00:19:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:51,532 INFO L225 Difference]: With dead ends: 7077 [2022-01-11 00:19:51,532 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:51,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,536 INFO L933 BasicCegarLoop]: 2629 mSDtfsCounter, 2474 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2474 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:51,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2474 Valid, 2762 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.3798144503795333) internal successors, (4908), 3557 states have internal predecessors, (4908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4908 transitions. [2022-01-11 00:19:51,717 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4908 transitions. Word has length 186 [2022-01-11 00:19:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:51,718 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4908 transitions. [2022-01-11 00:19:51,718 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-11 00:19:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4908 transitions. [2022-01-11 00:19:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:51,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:51,719 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:51,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 00:19:51,719 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:51,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2126535496, now seen corresponding path program 1 times [2022-01-11 00:19:51,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:51,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819419613] [2022-01-11 00:19:51,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:51,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:51,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:51,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819419613] [2022-01-11 00:19:51,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819419613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:51,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:51,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:51,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206200948] [2022-01-11 00:19:51,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:51,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:51,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,753 INFO L87 Difference]: Start difference. First operand 3558 states and 4908 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-11 00:19:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:51,907 INFO L93 Difference]: Finished difference Result 7076 states and 9762 transitions. [2022-01-11 00:19:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:51,908 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-11 00:19:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:51,913 INFO L225 Difference]: With dead ends: 7076 [2022-01-11 00:19:51,913 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:51,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,916 INFO L933 BasicCegarLoop]: 2609 mSDtfsCounter, 2454 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2454 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:51,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2454 Valid, 2741 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.3696935619904413) internal successors, (4872), 3557 states have internal predecessors, (4872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4872 transitions. [2022-01-11 00:19:52,041 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4872 transitions. Word has length 186 [2022-01-11 00:19:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:52,041 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4872 transitions. [2022-01-11 00:19:52,041 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-11 00:19:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4872 transitions. [2022-01-11 00:19:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:52,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:52,042 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:52,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 00:19:52,042 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:52,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 308312569, now seen corresponding path program 1 times [2022-01-11 00:19:52,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:52,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842707909] [2022-01-11 00:19:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:52,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:52,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:52,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842707909] [2022-01-11 00:19:52,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842707909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:52,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:52,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:52,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476616596] [2022-01-11 00:19:52,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:52,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:52,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:52,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:52,077 INFO L87 Difference]: Start difference. First operand 3558 states and 4872 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-11 00:19:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:52,261 INFO L93 Difference]: Finished difference Result 7075 states and 9689 transitions. [2022-01-11 00:19:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:52,262 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-11 00:19:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:52,267 INFO L225 Difference]: With dead ends: 7075 [2022-01-11 00:19:52,267 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:52,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:52,270 INFO L933 BasicCegarLoop]: 2589 mSDtfsCounter, 2434 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:52,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2434 Valid, 2720 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.3595726736013494) internal successors, (4836), 3557 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4836 transitions. [2022-01-11 00:19:52,397 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4836 transitions. Word has length 186 [2022-01-11 00:19:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:52,397 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4836 transitions. [2022-01-11 00:19:52,398 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-11 00:19:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4836 transitions. [2022-01-11 00:19:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:52,399 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:52,399 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:52,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 00:19:52,399 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:52,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1578987318, now seen corresponding path program 1 times [2022-01-11 00:19:52,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:52,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856279755] [2022-01-11 00:19:52,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:52,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:52,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:52,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856279755] [2022-01-11 00:19:52,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856279755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:52,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:52,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:52,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861371846] [2022-01-11 00:19:52,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:52,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:52,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:52,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:52,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:52,432 INFO L87 Difference]: Start difference. First operand 3558 states and 4836 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-11 00:19:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:52,586 INFO L93 Difference]: Finished difference Result 7074 states and 9616 transitions. [2022-01-11 00:19:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:52,586 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-11 00:19:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:52,592 INFO L225 Difference]: With dead ends: 7074 [2022-01-11 00:19:52,592 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:52,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:52,596 INFO L933 BasicCegarLoop]: 2569 mSDtfsCounter, 2414 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2414 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:52,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2414 Valid, 2699 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.3494517852122576) internal successors, (4800), 3557 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4800 transitions. [2022-01-11 00:19:52,793 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4800 transitions. Word has length 186 [2022-01-11 00:19:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:52,794 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4800 transitions. [2022-01-11 00:19:52,794 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-11 00:19:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4800 transitions. [2022-01-11 00:19:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:52,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:52,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:52,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 00:19:52,795 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 343800120, now seen corresponding path program 1 times [2022-01-11 00:19:52,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:52,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959197280] [2022-01-11 00:19:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:52,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:52,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:52,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959197280] [2022-01-11 00:19:52,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959197280] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:52,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:52,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:52,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686730882] [2022-01-11 00:19:52,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:52,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:52,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:52,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:52,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:52,848 INFO L87 Difference]: Start difference. First operand 3558 states and 4800 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-11 00:19:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:53,083 INFO L93 Difference]: Finished difference Result 7073 states and 9543 transitions. [2022-01-11 00:19:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:53,084 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-11 00:19:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:53,090 INFO L225 Difference]: With dead ends: 7073 [2022-01-11 00:19:53,090 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:53,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:53,095 INFO L933 BasicCegarLoop]: 2549 mSDtfsCounter, 2394 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:53,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2394 Valid, 2678 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.3393308968231656) internal successors, (4764), 3557 states have internal predecessors, (4764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4764 transitions. [2022-01-11 00:19:53,294 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4764 transitions. Word has length 186 [2022-01-11 00:19:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:53,294 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4764 transitions. [2022-01-11 00:19:53,294 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-11 00:19:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4764 transitions. [2022-01-11 00:19:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:53,295 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:53,296 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:53,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 00:19:53,296 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:53,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:53,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1472097430, now seen corresponding path program 1 times [2022-01-11 00:19:53,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:53,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895103649] [2022-01-11 00:19:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:53,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:53,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:53,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895103649] [2022-01-11 00:19:53,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895103649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:53,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:53,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:53,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706574302] [2022-01-11 00:19:53,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:53,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:53,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:53,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:53,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:53,335 INFO L87 Difference]: Start difference. First operand 3558 states and 4764 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-11 00:19:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:53,547 INFO L93 Difference]: Finished difference Result 7072 states and 9470 transitions. [2022-01-11 00:19:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:53,548 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-11 00:19:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:53,553 INFO L225 Difference]: With dead ends: 7072 [2022-01-11 00:19:53,553 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:53,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:53,558 INFO L933 BasicCegarLoop]: 2529 mSDtfsCounter, 2374 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:53,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2374 Valid, 2657 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.3292100084340737) internal successors, (4728), 3557 states have internal predecessors, (4728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4728 transitions. [2022-01-11 00:19:53,696 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4728 transitions. Word has length 186 [2022-01-11 00:19:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:53,696 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4728 transitions. [2022-01-11 00:19:53,696 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-11 00:19:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4728 transitions. [2022-01-11 00:19:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:53,700 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:53,700 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:53,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 00:19:53,700 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -989929513, now seen corresponding path program 1 times [2022-01-11 00:19:53,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:53,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656132186] [2022-01-11 00:19:53,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:53,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:53,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:53,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656132186] [2022-01-11 00:19:53,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656132186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:53,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:53,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:53,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260107459] [2022-01-11 00:19:53,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:53,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:53,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:53,737 INFO L87 Difference]: Start difference. First operand 3558 states and 4728 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-11 00:19:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:53,941 INFO L93 Difference]: Finished difference Result 7071 states and 9397 transitions. [2022-01-11 00:19:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:53,941 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-11 00:19:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:53,946 INFO L225 Difference]: With dead ends: 7071 [2022-01-11 00:19:53,946 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:53,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:53,949 INFO L933 BasicCegarLoop]: 2509 mSDtfsCounter, 2354 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:53,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2354 Valid, 2636 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.3190891200449817) internal successors, (4692), 3557 states have internal predecessors, (4692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4692 transitions. [2022-01-11 00:19:54,096 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4692 transitions. Word has length 186 [2022-01-11 00:19:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:54,097 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4692 transitions. [2022-01-11 00:19:54,097 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-11 00:19:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4692 transitions. [2022-01-11 00:19:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:54,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:54,098 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:54,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 00:19:54,099 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash -441388780, now seen corresponding path program 1 times [2022-01-11 00:19:54,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:54,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410285106] [2022-01-11 00:19:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:54,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:54,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:54,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410285106] [2022-01-11 00:19:54,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410285106] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:54,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:54,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:54,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285449375] [2022-01-11 00:19:54,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:54,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:54,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:54,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:54,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:54,155 INFO L87 Difference]: Start difference. First operand 3558 states and 4692 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-11 00:19:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:54,330 INFO L93 Difference]: Finished difference Result 7070 states and 9324 transitions. [2022-01-11 00:19:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:54,330 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-11 00:19:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:54,334 INFO L225 Difference]: With dead ends: 7070 [2022-01-11 00:19:54,334 INFO L226 Difference]: Without dead ends: 3558 [2022-01-11 00:19:54,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:54,338 INFO L933 BasicCegarLoop]: 2489 mSDtfsCounter, 2334 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:54,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2334 Valid, 2615 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2022-01-11 00:19:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3558. [2022-01-11 00:19:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.3089682316558897) internal successors, (4656), 3557 states have internal predecessors, (4656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4656 transitions. [2022-01-11 00:19:54,483 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4656 transitions. Word has length 186 [2022-01-11 00:19:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:54,483 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4656 transitions. [2022-01-11 00:19:54,483 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-11 00:19:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4656 transitions. [2022-01-11 00:19:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:54,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:54,484 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:54,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 00:19:54,484 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:54,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash -791149739, now seen corresponding path program 1 times [2022-01-11 00:19:54,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:54,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201539388] [2022-01-11 00:19:54,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:54,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:54,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201539388] [2022-01-11 00:19:54,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201539388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:54,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:54,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:54,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849179687] [2022-01-11 00:19:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:54,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:54,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:54,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:54,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:54,544 INFO L87 Difference]: Start difference. First operand 3558 states and 4656 transitions. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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-11 00:19:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:54,908 INFO L93 Difference]: Finished difference Result 8252 states and 10883 transitions. [2022-01-11 00:19:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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-11 00:19:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:54,913 INFO L225 Difference]: With dead ends: 8252 [2022-01-11 00:19:54,913 INFO L226 Difference]: Without dead ends: 4754 [2022-01-11 00:19:54,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:19:54,917 INFO L933 BasicCegarLoop]: 2669 mSDtfsCounter, 7054 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7054 SdHoareTripleChecker+Valid, 5170 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:54,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7054 Valid, 5170 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2022-01-11 00:19:55,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 3564. [2022-01-11 00:19:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.300589390962672) internal successors, (4634), 3563 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4634 transitions. [2022-01-11 00:19:55,105 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4634 transitions. Word has length 186 [2022-01-11 00:19:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:55,105 INFO L470 AbstractCegarLoop]: Abstraction has 3564 states and 4634 transitions. [2022-01-11 00:19:55,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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-11 00:19:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4634 transitions. [2022-01-11 00:19:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:55,106 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:55,106 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:55,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 00:19:55,106 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:55,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1265175722, now seen corresponding path program 1 times [2022-01-11 00:19:55,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:55,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796968769] [2022-01-11 00:19:55,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:55,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:55,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:55,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796968769] [2022-01-11 00:19:55,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796968769] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:55,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:55,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:55,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903900028] [2022-01-11 00:19:55,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:55,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:55,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:55,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:55,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:55,153 INFO L87 Difference]: Start difference. First operand 3564 states and 4634 transitions. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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-11 00:19:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:55,563 INFO L93 Difference]: Finished difference Result 9075 states and 11865 transitions. [2022-01-11 00:19:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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-11 00:19:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:55,570 INFO L225 Difference]: With dead ends: 9075 [2022-01-11 00:19:55,570 INFO L226 Difference]: Without dead ends: 5606 [2022-01-11 00:19:55,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:19:55,574 INFO L933 BasicCegarLoop]: 2564 mSDtfsCounter, 6211 mSDsluCounter, 4318 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6211 SdHoareTripleChecker+Valid, 6882 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:55,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6211 Valid, 6882 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5606 states. [2022-01-11 00:19:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5606 to 3570. [2022-01-11 00:19:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3569 states have (on average 1.2922387223311853) internal successors, (4612), 3569 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 4612 transitions. [2022-01-11 00:19:55,820 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 4612 transitions. Word has length 186 [2022-01-11 00:19:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:55,820 INFO L470 AbstractCegarLoop]: Abstraction has 3570 states and 4612 transitions. [2022-01-11 00:19:55,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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-11 00:19:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 4612 transitions. [2022-01-11 00:19:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 00:19:55,821 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:55,821 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, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:55,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 00:19:55,821 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash -749655273, now seen corresponding path program 1 times [2022-01-11 00:19:55,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:55,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088208047] [2022-01-11 00:19:55,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:55,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:55,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:55,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088208047] [2022-01-11 00:19:55,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088208047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:55,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:55,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:55,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553774573] [2022-01-11 00:19:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:55,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:55,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:55,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:55,870 INFO L87 Difference]: Start difference. First operand 3570 states and 4612 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 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-11 00:19:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:56,303 INFO L93 Difference]: Finished difference Result 10430 states and 13427 transitions. [2022-01-11 00:19:56,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:56,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 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-11 00:19:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:56,311 INFO L225 Difference]: With dead ends: 10430 [2022-01-11 00:19:56,311 INFO L226 Difference]: Without dead ends: 7033 [2022-01-11 00:19:56,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:56,316 INFO L933 BasicCegarLoop]: 2477 mSDtfsCounter, 2246 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2246 SdHoareTripleChecker+Valid, 4923 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:56,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2246 Valid, 4923 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2022-01-11 00:19:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 6834. [2022-01-11 00:19:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6834 states, 6833 states have (on average 1.2833308941899604) internal successors, (8769), 6833 states have internal predecessors, (8769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6834 states to 6834 states and 8769 transitions. [2022-01-11 00:19:56,753 INFO L78 Accepts]: Start accepts. Automaton has 6834 states and 8769 transitions. Word has length 186 [2022-01-11 00:19:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:56,754 INFO L470 AbstractCegarLoop]: Abstraction has 6834 states and 8769 transitions. [2022-01-11 00:19:56,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 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-11 00:19:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6834 states and 8769 transitions. [2022-01-11 00:19:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-01-11 00:19:56,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:56,756 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:56,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 00:19:56,756 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1875064904, now seen corresponding path program 1 times [2022-01-11 00:19:56,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636341880] [2022-01-11 00:19:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:56,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:56,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:56,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636341880] [2022-01-11 00:19:56,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636341880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:56,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:56,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:56,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111649207] [2022-01-11 00:19:56,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:56,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:56,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:56,808 INFO L87 Difference]: Start difference. First operand 6834 states and 8769 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:57,551 INFO L93 Difference]: Finished difference Result 19658 states and 25189 transitions. [2022-01-11 00:19:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:57,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2022-01-11 00:19:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:57,566 INFO L225 Difference]: With dead ends: 19658 [2022-01-11 00:19:57,566 INFO L226 Difference]: Without dead ends: 13165 [2022-01-11 00:19:57,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:57,574 INFO L933 BasicCegarLoop]: 4018 mSDtfsCounter, 2100 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:57,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2100 Valid, 6477 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13165 states. [2022-01-11 00:19:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13165 to 13162. [2022-01-11 00:19:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13162 states, 13161 states have (on average 1.2784742800699036) internal successors, (16826), 13161 states have internal predecessors, (16826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13162 states to 13162 states and 16826 transitions. [2022-01-11 00:19:58,335 INFO L78 Accepts]: Start accepts. Automaton has 13162 states and 16826 transitions. Word has length 187 [2022-01-11 00:19:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:58,335 INFO L470 AbstractCegarLoop]: Abstraction has 13162 states and 16826 transitions. [2022-01-11 00:19:58,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 13162 states and 16826 transitions. [2022-01-11 00:19:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-01-11 00:19:58,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:58,338 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:58,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 00:19:58,338 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:58,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1200998119, now seen corresponding path program 1 times [2022-01-11 00:19:58,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:58,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881212412] [2022-01-11 00:19:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:58,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:58,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:58,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881212412] [2022-01-11 00:19:58,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881212412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:58,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:58,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:58,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978897181] [2022-01-11 00:19:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:58,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:58,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:58,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:58,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:58,365 INFO L87 Difference]: Start difference. First operand 13162 states and 16826 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:59,116 INFO L93 Difference]: Finished difference Result 25649 states and 32826 transitions. [2022-01-11 00:19:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:59,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2022-01-11 00:19:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:59,136 INFO L225 Difference]: With dead ends: 25649 [2022-01-11 00:19:59,136 INFO L226 Difference]: Without dead ends: 12828 [2022-01-11 00:19:59,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:59,152 INFO L933 BasicCegarLoop]: 2477 mSDtfsCounter, 2473 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2473 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:59,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2473 Valid, 2477 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12828 states. [2022-01-11 00:19:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12828 to 12828. [2022-01-11 00:19:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12828 states, 12827 states have (on average 1.2798004209869807) internal successors, (16416), 12827 states have internal predecessors, (16416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12828 states to 12828 states and 16416 transitions. [2022-01-11 00:19:59,937 INFO L78 Accepts]: Start accepts. Automaton has 12828 states and 16416 transitions. Word has length 187 [2022-01-11 00:19:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:59,937 INFO L470 AbstractCegarLoop]: Abstraction has 12828 states and 16416 transitions. [2022-01-11 00:19:59,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:19:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 12828 states and 16416 transitions. [2022-01-11 00:19:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-11 00:19:59,941 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:59,942 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:19:59,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 00:19:59,942 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:59,942 INFO L85 PathProgramCache]: Analyzing trace with hash 997071439, now seen corresponding path program 1 times [2022-01-11 00:19:59,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:59,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098490069] [2022-01-11 00:19:59,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:59,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:59,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098490069] [2022-01-11 00:19:59,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098490069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:59,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:59,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:59,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978706992] [2022-01-11 00:19:59,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:59,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:59,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:59,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:59,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:59,999 INFO L87 Difference]: Start difference. First operand 12828 states and 16416 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-11 00:20:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:01,535 INFO L93 Difference]: Finished difference Result 37868 states and 48420 transitions. [2022-01-11 00:20:01,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:01,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-11 00:20:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:01,575 INFO L225 Difference]: With dead ends: 37868 [2022-01-11 00:20:01,575 INFO L226 Difference]: Without dead ends: 25381 [2022-01-11 00:20:01,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:01,594 INFO L933 BasicCegarLoop]: 2973 mSDtfsCounter, 2248 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 5415 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:01,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2248 Valid, 5415 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25381 states. [2022-01-11 00:20:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25381 to 24730. [2022-01-11 00:20:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24730 states, 24729 states have (on average 1.277043147721299) internal successors, (31580), 24729 states have internal predecessors, (31580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24730 states to 24730 states and 31580 transitions. [2022-01-11 00:20:03,142 INFO L78 Accepts]: Start accepts. Automaton has 24730 states and 31580 transitions. Word has length 188 [2022-01-11 00:20:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:03,143 INFO L470 AbstractCegarLoop]: Abstraction has 24730 states and 31580 transitions. [2022-01-11 00:20:03,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-11 00:20:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 24730 states and 31580 transitions. [2022-01-11 00:20:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-11 00:20:03,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:03,147 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:20:03,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 00:20:03,147 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2117189999, now seen corresponding path program 1 times [2022-01-11 00:20:03,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:03,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848295694] [2022-01-11 00:20:03,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:03,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:20:03,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:03,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848295694] [2022-01-11 00:20:03,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848295694] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:03,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:03,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:03,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882726734] [2022-01-11 00:20:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:03,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:03,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:03,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:03,173 INFO L87 Difference]: Start difference. First operand 24730 states and 31580 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-11 00:20:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:04,615 INFO L93 Difference]: Finished difference Result 48999 states and 62594 transitions. [2022-01-11 00:20:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:04,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-11 00:20:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:04,649 INFO L225 Difference]: With dead ends: 48999 [2022-01-11 00:20:04,649 INFO L226 Difference]: Without dead ends: 24398 [2022-01-11 00:20:04,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:04,672 INFO L933 BasicCegarLoop]: 2476 mSDtfsCounter, 2471 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2471 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:04,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2471 Valid, 2476 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24398 states. [2022-01-11 00:20:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24398 to 24398. [2022-01-11 00:20:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24398 states, 24397 states have (on average 1.2777800549247857) internal successors, (31174), 24397 states have internal predecessors, (31174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24398 states to 24398 states and 31174 transitions. [2022-01-11 00:20:06,491 INFO L78 Accepts]: Start accepts. Automaton has 24398 states and 31174 transitions. Word has length 188 [2022-01-11 00:20:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:06,491 INFO L470 AbstractCegarLoop]: Abstraction has 24398 states and 31174 transitions. [2022-01-11 00:20:06,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-11 00:20:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 24398 states and 31174 transitions. [2022-01-11 00:20:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-01-11 00:20:06,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:06,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:20:06,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 00:20:06,495 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:06,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1879309547, now seen corresponding path program 1 times [2022-01-11 00:20:06,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:06,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215521237] [2022-01-11 00:20:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:06,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:20:06,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:06,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215521237] [2022-01-11 00:20:06,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215521237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:06,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:06,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:06,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925024581] [2022-01-11 00:20:06,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:06,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:06,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:06,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:06,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:06,539 INFO L87 Difference]: Start difference. First operand 24398 states and 31174 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:09,705 INFO L93 Difference]: Finished difference Result 72270 states and 92294 transitions. [2022-01-11 00:20:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:09,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2022-01-11 00:20:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:09,785 INFO L225 Difference]: With dead ends: 72270 [2022-01-11 00:20:09,785 INFO L226 Difference]: Without dead ends: 48213 [2022-01-11 00:20:09,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:09,820 INFO L933 BasicCegarLoop]: 2921 mSDtfsCounter, 2248 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 5361 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:09,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2248 Valid, 5361 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48213 states. [2022-01-11 00:20:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48213 to 47026. [2022-01-11 00:20:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47026 states, 47025 states have (on average 1.2760446570972888) internal successors, (60006), 47025 states have internal predecessors, (60006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47026 states to 47026 states and 60006 transitions. [2022-01-11 00:20:13,194 INFO L78 Accepts]: Start accepts. Automaton has 47026 states and 60006 transitions. Word has length 189 [2022-01-11 00:20:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:13,194 INFO L470 AbstractCegarLoop]: Abstraction has 47026 states and 60006 transitions. [2022-01-11 00:20:13,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 47026 states and 60006 transitions. [2022-01-11 00:20:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-01-11 00:20:13,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:13,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:20:13,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 00:20:13,199 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash -952210285, now seen corresponding path program 1 times [2022-01-11 00:20:13,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:13,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136948125] [2022-01-11 00:20:13,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:13,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:20:13,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136948125] [2022-01-11 00:20:13,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136948125] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:13,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:13,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:13,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724180821] [2022-01-11 00:20:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:13,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:13,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:13,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:13,233 INFO L87 Difference]: Start difference. First operand 47026 states and 60006 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:16,598 INFO L93 Difference]: Finished difference Result 93579 states and 119434 transitions. [2022-01-11 00:20:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:16,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2022-01-11 00:20:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:16,666 INFO L225 Difference]: With dead ends: 93579 [2022-01-11 00:20:16,667 INFO L226 Difference]: Without dead ends: 46696 [2022-01-11 00:20:16,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:16,702 INFO L933 BasicCegarLoop]: 2475 mSDtfsCounter, 2469 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2469 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:16,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2469 Valid, 2475 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46696 states. [2022-01-11 00:20:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46696 to 46696. [2022-01-11 00:20:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46696 states, 46695 states have (on average 1.276453581753935) internal successors, (59604), 46695 states have internal predecessors, (59604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46696 states to 46696 states and 59604 transitions. [2022-01-11 00:20:20,002 INFO L78 Accepts]: Start accepts. Automaton has 46696 states and 59604 transitions. Word has length 189 [2022-01-11 00:20:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:20,002 INFO L470 AbstractCegarLoop]: Abstraction has 46696 states and 59604 transitions. [2022-01-11 00:20:20,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 46696 states and 59604 transitions. [2022-01-11 00:20:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-11 00:20:20,006 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:20,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:20:20,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 00:20:20,016 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:20,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1096250147, now seen corresponding path program 1 times [2022-01-11 00:20:20,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:20,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637332576] [2022-01-11 00:20:20,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:20,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:20:20,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:20,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637332576] [2022-01-11 00:20:20,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637332576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:20,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:20,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:20,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208656645] [2022-01-11 00:20:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:20,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:20,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:20,140 INFO L87 Difference]: Start difference. First operand 46696 states and 59604 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:26,039 INFO L93 Difference]: Finished difference Result 138432 states and 176628 transitions. [2022-01-11 00:20:26,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:26,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2022-01-11 00:20:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:26,175 INFO L225 Difference]: With dead ends: 138432 [2022-01-11 00:20:26,175 INFO L226 Difference]: Without dead ends: 92077 [2022-01-11 00:20:26,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:26,211 INFO L933 BasicCegarLoop]: 3027 mSDtfsCounter, 2248 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 5465 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:26,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2248 Valid, 5465 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92077 states. [2022-01-11 00:20:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92077 to 89930. [2022-01-11 00:20:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89930 states, 89929 states have (on average 1.2751837560742363) internal successors, (114676), 89929 states have internal predecessors, (114676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89930 states to 89930 states and 114676 transitions. [2022-01-11 00:20:32,659 INFO L78 Accepts]: Start accepts. Automaton has 89930 states and 114676 transitions. Word has length 190 [2022-01-11 00:20:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:32,659 INFO L470 AbstractCegarLoop]: Abstraction has 89930 states and 114676 transitions. [2022-01-11 00:20:32,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 89930 states and 114676 transitions. [2022-01-11 00:20:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-11 00:20:32,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:32,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:20:32,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 00:20:32,666 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:32,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:32,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1341632829, now seen corresponding path program 1 times [2022-01-11 00:20:32,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:32,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426529962] [2022-01-11 00:20:32,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:32,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:20:32,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:32,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426529962] [2022-01-11 00:20:32,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426529962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:32,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:32,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:32,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167271764] [2022-01-11 00:20:32,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:32,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:32,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:32,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:32,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:32,740 INFO L87 Difference]: Start difference. First operand 89930 states and 114676 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:39,160 INFO L93 Difference]: Finished difference Result 179375 states and 228762 transitions. [2022-01-11 00:20:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2022-01-11 00:20:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:39,293 INFO L225 Difference]: With dead ends: 179375 [2022-01-11 00:20:39,293 INFO L226 Difference]: Without dead ends: 89602 [2022-01-11 00:20:39,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:39,360 INFO L933 BasicCegarLoop]: 2474 mSDtfsCounter, 2467 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2467 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:39,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2467 Valid, 2474 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89602 states. [2022-01-11 00:20:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89602 to 89602. [2022-01-11 00:20:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89602 states, 89601 states have (on average 1.2754098726576713) internal successors, (114278), 89601 states have internal predecessors, (114278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89602 states to 89602 states and 114278 transitions. [2022-01-11 00:20:45,692 INFO L78 Accepts]: Start accepts. Automaton has 89602 states and 114278 transitions. Word has length 190 [2022-01-11 00:20:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:45,692 INFO L470 AbstractCegarLoop]: Abstraction has 89602 states and 114278 transitions. [2022-01-11 00:20:45,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:20:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 89602 states and 114278 transitions. [2022-01-11 00:20:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-01-11 00:20:45,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:45,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:20:45,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 00:20:45,696 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:45,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1125243592, now seen corresponding path program 1 times [2022-01-11 00:20:45,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:45,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637493705] [2022-01-11 00:20:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:45,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:20:45,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637493705] [2022-01-11 00:20:45,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637493705] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:45,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:45,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:45,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850635331] [2022-01-11 00:20:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:45,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:45,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:45,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:45,940 INFO L87 Difference]: Start difference. First operand 89602 states and 114278 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 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)