/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:41:50,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:41:50,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:41:50,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:41:50,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:41:50,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:41:50,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:41:50,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:41:50,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:41:50,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:41:50,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:41:50,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:41:50,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:41:50,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:41:50,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:41:50,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:41:50,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:41:50,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:41:50,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:41:50,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:41:50,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:41:50,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:41:50,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:41:50,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:41:50,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:41:50,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:41:50,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:41:50,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:41:50,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:41:50,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:41:50,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:41:50,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:41:50,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:41:50,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:41:50,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:41:50,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:41:50,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:41:50,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:41:50,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:41:50,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:41:50,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:41:50,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:41:50,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:41:50,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:41:50,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:41:50,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:41:50,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:41:50,612 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:41:50,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:41:50,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:41:50,613 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:41:50,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:41:50,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:41:50,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:41:50,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:41:50,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:41:50,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:41:50,614 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:41:50,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:41:50,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:41:50,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:41:50,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:41:50,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:41:50,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:41:50,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:41:50,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:41:50,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:41:50,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:41:50,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:41:50,617 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:41:50,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:41:50,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:41:50,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:41:50,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:41:50,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:41:50,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:41:50,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:41:50,821 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:41:50,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2022-01-10 01:41:50,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9123de79/ebd3d99ff22945569d68b3047daf705d/FLAG7d87da10d [2022-01-10 01:41:51,473 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:41:51,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2022-01-10 01:41:51,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9123de79/ebd3d99ff22945569d68b3047daf705d/FLAG7d87da10d [2022-01-10 01:41:51,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9123de79/ebd3d99ff22945569d68b3047daf705d [2022-01-10 01:41:51,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:41:51,655 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:41:51,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:41:51,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:41:51,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:41:51,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:41:51" (1/1) ... [2022-01-10 01:41:51,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712dbfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:51, skipping insertion in model container [2022-01-10 01:41:51,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:41:51" (1/1) ... [2022-01-10 01:41:51,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:41:51,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:41:52,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2022-01-10 01:41:52,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2022-01-10 01:41:52,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2022-01-10 01:41:52,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2022-01-10 01:41:52,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2022-01-10 01:41:52,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2022-01-10 01:41:52,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2022-01-10 01:41:52,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2022-01-10 01:41:52,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2022-01-10 01:41:52,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2022-01-10 01:41:52,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2022-01-10 01:41:52,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2022-01-10 01:41:52,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2022-01-10 01:41:52,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2022-01-10 01:41:52,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2022-01-10 01:41:52,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2022-01-10 01:41:52,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2022-01-10 01:41:52,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2022-01-10 01:41:52,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2022-01-10 01:41:52,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2022-01-10 01:41:52,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2022-01-10 01:41:52,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2022-01-10 01:41:52,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2022-01-10 01:41:52,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2022-01-10 01:41:52,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2022-01-10 01:41:52,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2022-01-10 01:41:52,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2022-01-10 01:41:52,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2022-01-10 01:41:52,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2022-01-10 01:41:53,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:41:53,079 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:41:53,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2022-01-10 01:41:53,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2022-01-10 01:41:53,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2022-01-10 01:41:53,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2022-01-10 01:41:53,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2022-01-10 01:41:53,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2022-01-10 01:41:53,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2022-01-10 01:41:53,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2022-01-10 01:41:53,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2022-01-10 01:41:53,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2022-01-10 01:41:53,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2022-01-10 01:41:53,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2022-01-10 01:41:53,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2022-01-10 01:41:53,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2022-01-10 01:41:53,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2022-01-10 01:41:53,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2022-01-10 01:41:53,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2022-01-10 01:41:53,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2022-01-10 01:41:53,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2022-01-10 01:41:53,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2022-01-10 01:41:53,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2022-01-10 01:41:53,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2022-01-10 01:41:53,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2022-01-10 01:41:53,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2022-01-10 01:41:53,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2022-01-10 01:41:53,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2022-01-10 01:41:53,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2022-01-10 01:41:53,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2022-01-10 01:41:53,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2022-01-10 01:41:53,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:41:53,685 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:41:53,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53 WrapperNode [2022-01-10 01:41:53,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:41:53,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:41:53,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:41:53,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:41:53,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:53,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:53,851 INFO L137 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12603 [2022-01-10 01:41:53,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:41:53,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:41:53,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:41:53,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:41:53,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:53,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:53,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:53,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:53,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:54,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:54,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:54,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:41:54,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:41:54,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:41:54,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:41:54,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (1/1) ... [2022-01-10 01:41:54,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:41:54,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:41:54,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 01:41:54,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 01:41:54,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:41:54,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:41:54,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:41:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:41:54,505 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:41:54,506 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:41:57,606 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:41:57,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:41:57,628 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 01:41:57,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:41:57 BoogieIcfgContainer [2022-01-10 01:41:57,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:41:57,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:41:57,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:41:57,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:41:57,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:41:51" (1/3) ... [2022-01-10 01:41:57,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa7f120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:41:57, skipping insertion in model container [2022-01-10 01:41:57,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:53" (2/3) ... [2022-01-10 01:41:57,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa7f120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:41:57, skipping insertion in model container [2022-01-10 01:41:57,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:41:57" (3/3) ... [2022-01-10 01:41:57,638 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2022-01-10 01:41:57,642 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:41:57,642 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-01-10 01:41:57,691 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:41:57,695 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 01:41:57,696 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-01-10 01:41:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 2082 states, 2052 states have (on average 1.8606237816764133) internal successors, (3818), 2081 states have internal predecessors, (3818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:41:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 01:41:57,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:41:57,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:41:57,751 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:41:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:41:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1477171740, now seen corresponding path program 1 times [2022-01-10 01:41:57,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:41:57,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996447960] [2022-01-10 01:41:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:41:57,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:41:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:41:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:41:58,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:41:58,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996447960] [2022-01-10 01:41:58,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996447960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:41:58,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:41:58,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:41:58,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570659911] [2022-01-10 01:41:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:41:58,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:41:58,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:41:58,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:41:58,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:41:58,160 INFO L87 Difference]: Start difference. First operand has 2082 states, 2052 states have (on average 1.8606237816764133) internal successors, (3818), 2081 states have internal predecessors, (3818), 0 states have call successors, (0), 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 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:41:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:41:59,504 INFO L93 Difference]: Finished difference Result 3681 states and 6458 transitions. [2022-01-10 01:41:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:41:59,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-01-10 01:41:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:41:59,528 INFO L225 Difference]: With dead ends: 3681 [2022-01-10 01:41:59,528 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 01:41:59,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:41:59,540 INFO L933 BasicCegarLoop]: 1861 mSDtfsCounter, 10114 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10114 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:41:59,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10114 Valid, 2458 Invalid, 1292 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 01:41:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 01:41:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2054. [2022-01-10 01:41:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2025 states have (on average 1.3688888888888888) internal successors, (2772), 2053 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:41:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2772 transitions. [2022-01-10 01:41:59,638 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2772 transitions. Word has length 101 [2022-01-10 01:41:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:41:59,639 INFO L470 AbstractCegarLoop]: Abstraction has 2054 states and 2772 transitions. [2022-01-10 01:41:59,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:41:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2772 transitions. [2022-01-10 01:41:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-10 01:41:59,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:41:59,642 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] [2022-01-10 01:41:59,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:41:59,643 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:41:59,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:41:59,643 INFO L85 PathProgramCache]: Analyzing trace with hash 951904542, now seen corresponding path program 1 times [2022-01-10 01:41:59,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:41:59,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679512635] [2022-01-10 01:41:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:41:59,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:41:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:41:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:41:59,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:41:59,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679512635] [2022-01-10 01:41:59,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679512635] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:41:59,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:41:59,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:41:59,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567349650] [2022-01-10 01:41:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:41:59,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:41:59,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:41:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:41:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:41:59,785 INFO L87 Difference]: Start difference. First operand 2054 states and 2772 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:00,402 INFO L93 Difference]: Finished difference Result 3542 states and 4915 transitions. [2022-01-10 01:42:00,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:42:00,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-01-10 01:42:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:00,409 INFO L225 Difference]: With dead ends: 3542 [2022-01-10 01:42:00,409 INFO L226 Difference]: Without dead ends: 1822 [2022-01-10 01:42:00,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:42:00,415 INFO L933 BasicCegarLoop]: 974 mSDtfsCounter, 5185 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5185 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:00,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5185 Valid, 1010 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 01:42:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2022-01-10 01:42:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2022-01-10 01:42:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1793 states have (on average 1.3976575571667595) internal successors, (2506), 1821 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2506 transitions. [2022-01-10 01:42:00,570 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2506 transitions. Word has length 102 [2022-01-10 01:42:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:00,570 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 2506 transitions. [2022-01-10 01:42:00,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2506 transitions. [2022-01-10 01:42:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 01:42:00,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:00,585 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] [2022-01-10 01:42:00,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:42:00,585 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash -873201018, now seen corresponding path program 1 times [2022-01-10 01:42:00,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:00,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976405410] [2022-01-10 01:42:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:00,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:00,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:00,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976405410] [2022-01-10 01:42:00,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976405410] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:00,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:00,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:42:00,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178425100] [2022-01-10 01:42:00,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:00,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:42:00,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:00,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:42:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:42:00,672 INFO L87 Difference]: Start difference. First operand 1822 states and 2506 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:01,514 INFO L93 Difference]: Finished difference Result 3310 states and 4647 transitions. [2022-01-10 01:42:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:42:01,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-01-10 01:42:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:01,520 INFO L225 Difference]: With dead ends: 3310 [2022-01-10 01:42:01,520 INFO L226 Difference]: Without dead ends: 1742 [2022-01-10 01:42:01,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:42:01,523 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 4732 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4732 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:01,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4732 Valid, 774 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 01:42:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2022-01-10 01:42:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2022-01-10 01:42:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1713 states have (on average 1.4057209573847051) internal successors, (2408), 1741 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2408 transitions. [2022-01-10 01:42:01,609 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2408 transitions. Word has length 103 [2022-01-10 01:42:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:01,609 INFO L470 AbstractCegarLoop]: Abstraction has 1742 states and 2408 transitions. [2022-01-10 01:42:01,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2408 transitions. [2022-01-10 01:42:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 01:42:01,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:01,612 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] [2022-01-10 01:42:01,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 01:42:01,612 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1608818971, now seen corresponding path program 1 times [2022-01-10 01:42:01,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:01,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460670652] [2022-01-10 01:42:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:01,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:01,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:01,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460670652] [2022-01-10 01:42:01,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460670652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:01,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:01,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:42:01,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729402907] [2022-01-10 01:42:01,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:01,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:42:01,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:01,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:42:01,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:42:01,696 INFO L87 Difference]: Start difference. First operand 1742 states and 2408 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:02,377 INFO L93 Difference]: Finished difference Result 3230 states and 4547 transitions. [2022-01-10 01:42:02,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:42:02,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-01-10 01:42:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:02,384 INFO L225 Difference]: With dead ends: 3230 [2022-01-10 01:42:02,384 INFO L226 Difference]: Without dead ends: 1654 [2022-01-10 01:42:02,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:42:02,389 INFO L933 BasicCegarLoop]: 862 mSDtfsCounter, 4637 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:02,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4637 Valid, 890 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 01:42:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2022-01-10 01:42:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1654. [2022-01-10 01:42:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1625 states have (on average 1.4215384615384616) internal successors, (2310), 1653 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2310 transitions. [2022-01-10 01:42:02,441 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2310 transitions. Word has length 104 [2022-01-10 01:42:02,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:02,442 INFO L470 AbstractCegarLoop]: Abstraction has 1654 states and 2310 transitions. [2022-01-10 01:42:02,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2310 transitions. [2022-01-10 01:42:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 01:42:02,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:02,452 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] [2022-01-10 01:42:02,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 01:42:02,452 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1915103433, now seen corresponding path program 1 times [2022-01-10 01:42:02,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902392107] [2022-01-10 01:42:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:02,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:02,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:02,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902392107] [2022-01-10 01:42:02,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902392107] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:02,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:02,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:42:02,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115769551] [2022-01-10 01:42:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:02,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:42:02,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:02,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:42:02,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:42:02,553 INFO L87 Difference]: Start difference. First operand 1654 states and 2310 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:03,089 INFO L93 Difference]: Finished difference Result 3142 states and 4447 transitions. [2022-01-10 01:42:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:42:03,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-01-10 01:42:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:03,094 INFO L225 Difference]: With dead ends: 3142 [2022-01-10 01:42:03,094 INFO L226 Difference]: Without dead ends: 1601 [2022-01-10 01:42:03,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:42:03,096 INFO L933 BasicCegarLoop]: 849 mSDtfsCounter, 4501 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4501 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:03,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4501 Valid, 861 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 01:42:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-01-10 01:42:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2022-01-10 01:42:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1572 states have (on average 1.4319338422391859) internal successors, (2251), 1600 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2251 transitions. [2022-01-10 01:42:03,155 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2251 transitions. Word has length 105 [2022-01-10 01:42:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:03,155 INFO L470 AbstractCegarLoop]: Abstraction has 1601 states and 2251 transitions. [2022-01-10 01:42:03,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2251 transitions. [2022-01-10 01:42:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 01:42:03,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:03,157 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] [2022-01-10 01:42:03,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 01:42:03,158 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:03,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -578368317, now seen corresponding path program 1 times [2022-01-10 01:42:03,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:03,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617450165] [2022-01-10 01:42:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:03,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:03,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:03,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617450165] [2022-01-10 01:42:03,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617450165] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:03,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:03,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:42:03,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558708444] [2022-01-10 01:42:03,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:03,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:42:03,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:03,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:42:03,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:42:03,273 INFO L87 Difference]: Start difference. First operand 1601 states and 2251 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:03,923 INFO L93 Difference]: Finished difference Result 3089 states and 4386 transitions. [2022-01-10 01:42:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:42:03,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-01-10 01:42:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:03,928 INFO L225 Difference]: With dead ends: 3089 [2022-01-10 01:42:03,928 INFO L226 Difference]: Without dead ends: 1576 [2022-01-10 01:42:03,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:42:03,931 INFO L933 BasicCegarLoop]: 828 mSDtfsCounter, 4400 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4400 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:03,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4400 Valid, 848 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 01:42:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-01-10 01:42:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2022-01-10 01:42:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1547 states have (on average 1.436328377504848) internal successors, (2222), 1575 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2222 transitions. [2022-01-10 01:42:03,992 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2222 transitions. Word has length 106 [2022-01-10 01:42:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:03,992 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2222 transitions. [2022-01-10 01:42:03,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2222 transitions. [2022-01-10 01:42:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 01:42:03,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:03,995 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] [2022-01-10 01:42:03,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 01:42:03,995 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:03,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1323333204, now seen corresponding path program 1 times [2022-01-10 01:42:03,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:03,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88833079] [2022-01-10 01:42:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:03,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:04,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:04,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88833079] [2022-01-10 01:42:04,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88833079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:04,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:04,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:42:04,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025144560] [2022-01-10 01:42:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:04,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:42:04,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:42:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:42:04,072 INFO L87 Difference]: Start difference. First operand 1576 states and 2222 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:04,720 INFO L93 Difference]: Finished difference Result 3064 states and 4355 transitions. [2022-01-10 01:42:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:42:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-01-10 01:42:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:04,725 INFO L225 Difference]: With dead ends: 3064 [2022-01-10 01:42:04,725 INFO L226 Difference]: Without dead ends: 1568 [2022-01-10 01:42:04,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:42:04,728 INFO L933 BasicCegarLoop]: 737 mSDtfsCounter, 4253 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:04,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4253 Valid, 781 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 01:42:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2022-01-10 01:42:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2022-01-10 01:42:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4366471734892787) internal successors, (2211), 1567 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2211 transitions. [2022-01-10 01:42:04,842 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2211 transitions. Word has length 107 [2022-01-10 01:42:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:04,843 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2211 transitions. [2022-01-10 01:42:04,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2211 transitions. [2022-01-10 01:42:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 01:42:04,846 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:04,846 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] [2022-01-10 01:42:04,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 01:42:04,846 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash 65664385, now seen corresponding path program 1 times [2022-01-10 01:42:04,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:04,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920453116] [2022-01-10 01:42:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:04,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:04,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-10 01:42:04,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:04,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920453116] [2022-01-10 01:42:04,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920453116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:05,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:05,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 01:42:05,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99345220] [2022-01-10 01:42:05,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:05,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 01:42:05,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:05,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 01:42:05,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:42:05,001 INFO L87 Difference]: Start difference. First operand 1568 states and 2211 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:06,794 INFO L93 Difference]: Finished difference Result 3025 states and 4293 transitions. [2022-01-10 01:42:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 01:42:06,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-01-10 01:42:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:06,802 INFO L225 Difference]: With dead ends: 3025 [2022-01-10 01:42:06,802 INFO L226 Difference]: Without dead ends: 2757 [2022-01-10 01:42:06,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-01-10 01:42:06,804 INFO L933 BasicCegarLoop]: 878 mSDtfsCounter, 4567 mSDsluCounter, 3693 mSDsCounter, 0 mSdLazyCounter, 3783 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 4571 SdHoareTripleChecker+Invalid, 3828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:06,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4567 Valid, 4571 Invalid, 3828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3783 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 01:42:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2022-01-10 01:42:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 1568. [2022-01-10 01:42:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4353476283300846) internal successors, (2209), 1567 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2209 transitions. [2022-01-10 01:42:06,966 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2209 transitions. Word has length 108 [2022-01-10 01:42:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:06,966 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2209 transitions. [2022-01-10 01:42:06,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2209 transitions. [2022-01-10 01:42:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 01:42:06,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:06,968 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] [2022-01-10 01:42:06,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 01:42:06,969 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:06,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:06,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1945173323, now seen corresponding path program 1 times [2022-01-10 01:42:06,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:06,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905730801] [2022-01-10 01:42:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:06,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:07,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:07,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905730801] [2022-01-10 01:42:07,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905730801] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:07,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:07,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:42:07,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106903472] [2022-01-10 01:42:07,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:07,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 01:42:07,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:07,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 01:42:07,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:42:07,083 INFO L87 Difference]: Start difference. First operand 1568 states and 2209 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:08,305 INFO L93 Difference]: Finished difference Result 2720 states and 3697 transitions. [2022-01-10 01:42:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 01:42:08,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-01-10 01:42:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:08,312 INFO L225 Difference]: With dead ends: 2720 [2022-01-10 01:42:08,312 INFO L226 Difference]: Without dead ends: 2051 [2022-01-10 01:42:08,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-01-10 01:42:08,315 INFO L933 BasicCegarLoop]: 675 mSDtfsCounter, 4748 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4748 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:08,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4748 Valid, 1666 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 01:42:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2022-01-10 01:42:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1568. [2022-01-10 01:42:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4346978557504872) internal successors, (2208), 1567 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2208 transitions. [2022-01-10 01:42:08,402 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2208 transitions. Word has length 108 [2022-01-10 01:42:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:08,402 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2208 transitions. [2022-01-10 01:42:08,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2208 transitions. [2022-01-10 01:42:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 01:42:08,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:08,404 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] [2022-01-10 01:42:08,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 01:42:08,405 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:08,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1618229889, now seen corresponding path program 1 times [2022-01-10 01:42:08,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:08,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913797612] [2022-01-10 01:42:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:08,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:08,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:08,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913797612] [2022-01-10 01:42:08,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913797612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:08,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:08,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:08,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520967108] [2022-01-10 01:42:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:08,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:08,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:08,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:08,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:08,532 INFO L87 Difference]: Start difference. First operand 1568 states and 2208 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:10,085 INFO L93 Difference]: Finished difference Result 2985 states and 4233 transitions. [2022-01-10 01:42:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-01-10 01:42:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:10,093 INFO L225 Difference]: With dead ends: 2985 [2022-01-10 01:42:10,093 INFO L226 Difference]: Without dead ends: 2765 [2022-01-10 01:42:10,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:10,095 INFO L933 BasicCegarLoop]: 894 mSDtfsCounter, 4359 mSDsluCounter, 2928 mSDsCounter, 0 mSdLazyCounter, 3117 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 3822 SdHoareTripleChecker+Invalid, 3156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:10,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4359 Valid, 3822 Invalid, 3156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3117 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 01:42:10,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2022-01-10 01:42:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1568. [2022-01-10 01:42:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4340480831708902) internal successors, (2207), 1567 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2207 transitions. [2022-01-10 01:42:10,198 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2207 transitions. Word has length 108 [2022-01-10 01:42:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:10,198 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2207 transitions. [2022-01-10 01:42:10,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2207 transitions. [2022-01-10 01:42:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 01:42:10,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:10,200 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] [2022-01-10 01:42:10,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 01:42:10,201 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash 180174419, now seen corresponding path program 1 times [2022-01-10 01:42:10,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:10,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925204835] [2022-01-10 01:42:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:10,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:10,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:10,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925204835] [2022-01-10 01:42:10,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925204835] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:10,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:10,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 01:42:10,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824500097] [2022-01-10 01:42:10,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:10,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 01:42:10,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 01:42:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-10 01:42:10,352 INFO L87 Difference]: Start difference. First operand 1568 states and 2207 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:12,368 INFO L93 Difference]: Finished difference Result 3060 states and 4332 transitions. [2022-01-10 01:42:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 01:42:12,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-01-10 01:42:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:12,376 INFO L225 Difference]: With dead ends: 3060 [2022-01-10 01:42:12,376 INFO L226 Difference]: Without dead ends: 2840 [2022-01-10 01:42:12,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2022-01-10 01:42:12,377 INFO L933 BasicCegarLoop]: 930 mSDtfsCounter, 6590 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 4453 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6590 SdHoareTripleChecker+Valid, 5403 SdHoareTripleChecker+Invalid, 4518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:12,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6590 Valid, 5403 Invalid, 4518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4453 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 01:42:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-01-10 01:42:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1575. [2022-01-10 01:42:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4340232858990944) internal successors, (2217), 1574 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2217 transitions. [2022-01-10 01:42:12,474 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2217 transitions. Word has length 108 [2022-01-10 01:42:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:12,474 INFO L470 AbstractCegarLoop]: Abstraction has 1575 states and 2217 transitions. [2022-01-10 01:42:12,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2217 transitions. [2022-01-10 01:42:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 01:42:12,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:12,476 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] [2022-01-10 01:42:12,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 01:42:12,476 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:12,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:12,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1822156941, now seen corresponding path program 1 times [2022-01-10 01:42:12,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:12,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747892917] [2022-01-10 01:42:12,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:12,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:12,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-10 01:42:12,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:12,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747892917] [2022-01-10 01:42:12,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747892917] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:12,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:12,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 01:42:12,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310582417] [2022-01-10 01:42:12,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:12,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 01:42:12,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:12,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 01:42:12,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-10 01:42:12,639 INFO L87 Difference]: Start difference. First operand 1575 states and 2217 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:14,288 INFO L93 Difference]: Finished difference Result 3154 states and 4445 transitions. [2022-01-10 01:42:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 01:42:14,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-01-10 01:42:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:14,296 INFO L225 Difference]: With dead ends: 3154 [2022-01-10 01:42:14,296 INFO L226 Difference]: Without dead ends: 2920 [2022-01-10 01:42:14,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2022-01-10 01:42:14,297 INFO L933 BasicCegarLoop]: 893 mSDtfsCounter, 7322 mSDsluCounter, 4334 mSDsCounter, 0 mSdLazyCounter, 4230 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7322 SdHoareTripleChecker+Valid, 5227 SdHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:14,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7322 Valid, 5227 Invalid, 4306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 4230 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 01:42:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2022-01-10 01:42:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1579. [2022-01-10 01:42:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1550 states have (on average 1.4329032258064516) internal successors, (2221), 1578 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2221 transitions. [2022-01-10 01:42:14,394 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2221 transitions. Word has length 108 [2022-01-10 01:42:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:14,395 INFO L470 AbstractCegarLoop]: Abstraction has 1579 states and 2221 transitions. [2022-01-10 01:42:14,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2221 transitions. [2022-01-10 01:42:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 01:42:14,397 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:14,397 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] [2022-01-10 01:42:14,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 01:42:14,397 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 57351997, now seen corresponding path program 1 times [2022-01-10 01:42:14,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:14,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726706542] [2022-01-10 01:42:14,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:14,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:14,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:14,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726706542] [2022-01-10 01:42:14,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726706542] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:14,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:14,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:14,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363447578] [2022-01-10 01:42:14,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:14,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:14,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:14,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:14,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:14,526 INFO L87 Difference]: Start difference. First operand 1579 states and 2221 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:16,284 INFO L93 Difference]: Finished difference Result 2397 states and 3412 transitions. [2022-01-10 01:42:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 01:42:16,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-01-10 01:42:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:16,289 INFO L225 Difference]: With dead ends: 2397 [2022-01-10 01:42:16,289 INFO L226 Difference]: Without dead ends: 2005 [2022-01-10 01:42:16,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2022-01-10 01:42:16,290 INFO L933 BasicCegarLoop]: 828 mSDtfsCounter, 4223 mSDsluCounter, 4012 mSDsCounter, 0 mSdLazyCounter, 3825 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4223 SdHoareTripleChecker+Valid, 4840 SdHoareTripleChecker+Invalid, 3849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:16,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4223 Valid, 4840 Invalid, 3849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3825 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 01:42:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2022-01-10 01:42:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1568. [2022-01-10 01:42:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.433398310591293) internal successors, (2206), 1567 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2206 transitions. [2022-01-10 01:42:16,397 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2206 transitions. Word has length 108 [2022-01-10 01:42:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:16,397 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2206 transitions. [2022-01-10 01:42:16,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2206 transitions. [2022-01-10 01:42:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:42:16,400 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:16,400 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] [2022-01-10 01:42:16,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 01:42:16,400 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash -860352434, now seen corresponding path program 1 times [2022-01-10 01:42:16,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:16,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599221815] [2022-01-10 01:42:16,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:16,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:16,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:16,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599221815] [2022-01-10 01:42:16,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599221815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:16,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:16,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:16,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768128922] [2022-01-10 01:42:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:16,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:16,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:16,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:16,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:16,516 INFO L87 Difference]: Start difference. First operand 1568 states and 2206 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:17,633 INFO L93 Difference]: Finished difference Result 2985 states and 4231 transitions. [2022-01-10 01:42:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:17,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 01:42:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:17,637 INFO L225 Difference]: With dead ends: 2985 [2022-01-10 01:42:17,637 INFO L226 Difference]: Without dead ends: 2765 [2022-01-10 01:42:17,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:17,638 INFO L933 BasicCegarLoop]: 894 mSDtfsCounter, 4197 mSDsluCounter, 2943 mSDsCounter, 0 mSdLazyCounter, 3110 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4197 SdHoareTripleChecker+Valid, 3837 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:17,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4197 Valid, 3837 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3110 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 01:42:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2022-01-10 01:42:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1568. [2022-01-10 01:42:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.432748538011696) internal successors, (2205), 1567 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2205 transitions. [2022-01-10 01:42:17,741 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2205 transitions. Word has length 110 [2022-01-10 01:42:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:17,742 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2205 transitions. [2022-01-10 01:42:17,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2205 transitions. [2022-01-10 01:42:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:42:17,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:17,744 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] [2022-01-10 01:42:17,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 01:42:17,744 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1432283502, now seen corresponding path program 1 times [2022-01-10 01:42:17,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:17,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45471510] [2022-01-10 01:42:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:17,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:17,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:17,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45471510] [2022-01-10 01:42:17,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45471510] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:17,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:17,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:17,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627536722] [2022-01-10 01:42:17,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:17,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:17,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:17,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:17,841 INFO L87 Difference]: Start difference. First operand 1568 states and 2205 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:19,208 INFO L93 Difference]: Finished difference Result 2999 states and 4243 transitions. [2022-01-10 01:42:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:19,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 01:42:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:19,212 INFO L225 Difference]: With dead ends: 2999 [2022-01-10 01:42:19,212 INFO L226 Difference]: Without dead ends: 2765 [2022-01-10 01:42:19,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:19,213 INFO L933 BasicCegarLoop]: 847 mSDtfsCounter, 7101 mSDsluCounter, 2778 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7101 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:19,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7101 Valid, 3625 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 01:42:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2022-01-10 01:42:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1568. [2022-01-10 01:42:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4320987654320987) internal successors, (2204), 1567 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2204 transitions. [2022-01-10 01:42:19,323 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2204 transitions. Word has length 110 [2022-01-10 01:42:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:19,323 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2204 transitions. [2022-01-10 01:42:19,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2204 transitions. [2022-01-10 01:42:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:42:19,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:19,325 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] [2022-01-10 01:42:19,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 01:42:19,325 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -983174856, now seen corresponding path program 1 times [2022-01-10 01:42:19,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:19,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554383679] [2022-01-10 01:42:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:19,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:19,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:19,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554383679] [2022-01-10 01:42:19,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554383679] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:19,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:19,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:19,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889791274] [2022-01-10 01:42:19,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:19,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:19,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:19,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:19,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:19,430 INFO L87 Difference]: Start difference. First operand 1568 states and 2204 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:20,753 INFO L93 Difference]: Finished difference Result 2875 states and 4050 transitions. [2022-01-10 01:42:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:20,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 01:42:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:20,756 INFO L225 Difference]: With dead ends: 2875 [2022-01-10 01:42:20,756 INFO L226 Difference]: Without dead ends: 2693 [2022-01-10 01:42:20,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:20,757 INFO L933 BasicCegarLoop]: 870 mSDtfsCounter, 4135 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4135 SdHoareTripleChecker+Valid, 3707 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:20,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4135 Valid, 3707 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 01:42:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2022-01-10 01:42:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 1568. [2022-01-10 01:42:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4314489928525016) internal successors, (2203), 1567 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2203 transitions. [2022-01-10 01:42:20,875 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2203 transitions. Word has length 110 [2022-01-10 01:42:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:20,875 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2203 transitions. [2022-01-10 01:42:20,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2203 transitions. [2022-01-10 01:42:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:42:20,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:20,877 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] [2022-01-10 01:42:20,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 01:42:20,877 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash 237293966, now seen corresponding path program 1 times [2022-01-10 01:42:20,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:20,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838435179] [2022-01-10 01:42:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:20,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:20,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:20,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838435179] [2022-01-10 01:42:20,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838435179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:20,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:20,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:20,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396171274] [2022-01-10 01:42:20,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:20,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:20,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:20,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:20,975 INFO L87 Difference]: Start difference. First operand 1568 states and 2203 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:22,248 INFO L93 Difference]: Finished difference Result 2978 states and 4219 transitions. [2022-01-10 01:42:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:22,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 01:42:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:22,252 INFO L225 Difference]: With dead ends: 2978 [2022-01-10 01:42:22,252 INFO L226 Difference]: Without dead ends: 2765 [2022-01-10 01:42:22,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:22,254 INFO L933 BasicCegarLoop]: 873 mSDtfsCounter, 6487 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6487 SdHoareTripleChecker+Valid, 3785 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:22,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6487 Valid, 3785 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 01:42:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2022-01-10 01:42:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1568. [2022-01-10 01:42:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4307992202729045) internal successors, (2202), 1567 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2202 transitions. [2022-01-10 01:42:22,381 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2202 transitions. Word has length 110 [2022-01-10 01:42:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:22,381 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2202 transitions. [2022-01-10 01:42:22,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2202 transitions. [2022-01-10 01:42:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:42:22,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:22,383 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] [2022-01-10 01:42:22,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 01:42:22,383 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2054601275, now seen corresponding path program 1 times [2022-01-10 01:42:22,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:22,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617055819] [2022-01-10 01:42:22,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:22,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:22,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:22,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617055819] [2022-01-10 01:42:22,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617055819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:22,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:22,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:22,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001600943] [2022-01-10 01:42:22,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:22,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:22,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:22,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:22,508 INFO L87 Difference]: Start difference. First operand 1568 states and 2202 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:23,924 INFO L93 Difference]: Finished difference Result 3065 states and 4350 transitions. [2022-01-10 01:42:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 01:42:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:23,928 INFO L225 Difference]: With dead ends: 3065 [2022-01-10 01:42:23,928 INFO L226 Difference]: Without dead ends: 2797 [2022-01-10 01:42:23,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-01-10 01:42:23,930 INFO L933 BasicCegarLoop]: 1051 mSDtfsCounter, 8019 mSDsluCounter, 3392 mSDsCounter, 0 mSdLazyCounter, 3554 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8019 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:23,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8019 Valid, 4443 Invalid, 3599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3554 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 01:42:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2022-01-10 01:42:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 1568. [2022-01-10 01:42:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4301494476933074) internal successors, (2201), 1567 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2201 transitions. [2022-01-10 01:42:24,069 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2201 transitions. Word has length 110 [2022-01-10 01:42:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:24,069 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2201 transitions. [2022-01-10 01:42:24,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2201 transitions. [2022-01-10 01:42:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:42:24,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:24,071 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] [2022-01-10 01:42:24,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 01:42:24,072 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:24,072 INFO L85 PathProgramCache]: Analyzing trace with hash -114020363, now seen corresponding path program 1 times [2022-01-10 01:42:24,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:24,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821466078] [2022-01-10 01:42:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:24,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:24,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:24,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821466078] [2022-01-10 01:42:24,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821466078] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:24,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:24,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:24,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752010300] [2022-01-10 01:42:24,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:24,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:24,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:24,169 INFO L87 Difference]: Start difference. First operand 1568 states and 2201 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:25,553 INFO L93 Difference]: Finished difference Result 3169 states and 4490 transitions. [2022-01-10 01:42:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:25,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 01:42:25,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:25,558 INFO L225 Difference]: With dead ends: 3169 [2022-01-10 01:42:25,558 INFO L226 Difference]: Without dead ends: 2797 [2022-01-10 01:42:25,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-01-10 01:42:25,559 INFO L933 BasicCegarLoop]: 1076 mSDtfsCounter, 7932 mSDsluCounter, 3424 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7932 SdHoareTripleChecker+Valid, 4500 SdHoareTripleChecker+Invalid, 3601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:25,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7932 Valid, 4500 Invalid, 3601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3556 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 01:42:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2022-01-10 01:42:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 1568. [2022-01-10 01:42:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.428849902534113) internal successors, (2199), 1567 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2199 transitions. [2022-01-10 01:42:25,699 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2199 transitions. Word has length 110 [2022-01-10 01:42:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:25,699 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2199 transitions. [2022-01-10 01:42:25,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2199 transitions. [2022-01-10 01:42:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:42:25,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:25,701 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] [2022-01-10 01:42:25,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 01:42:25,701 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:25,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 8802059, now seen corresponding path program 1 times [2022-01-10 01:42:25,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:25,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60125829] [2022-01-10 01:42:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:25,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:25,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60125829] [2022-01-10 01:42:25,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60125829] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:25,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:25,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:25,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919131755] [2022-01-10 01:42:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:25,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:25,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:25,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:25,780 INFO L87 Difference]: Start difference. First operand 1568 states and 2199 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:27,072 INFO L93 Difference]: Finished difference Result 3029 states and 4286 transitions. [2022-01-10 01:42:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:27,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 01:42:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:27,077 INFO L225 Difference]: With dead ends: 3029 [2022-01-10 01:42:27,077 INFO L226 Difference]: Without dead ends: 2765 [2022-01-10 01:42:27,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:27,080 INFO L933 BasicCegarLoop]: 1053 mSDtfsCounter, 7735 mSDsluCounter, 3424 mSDsCounter, 0 mSdLazyCounter, 3641 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7735 SdHoareTripleChecker+Valid, 4477 SdHoareTripleChecker+Invalid, 3713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:27,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7735 Valid, 4477 Invalid, 3713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 3641 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 01:42:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2022-01-10 01:42:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1568. [2022-01-10 01:42:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4275503573749189) internal successors, (2197), 1567 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2197 transitions. [2022-01-10 01:42:27,229 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2197 transitions. Word has length 110 [2022-01-10 01:42:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:27,229 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2197 transitions. [2022-01-10 01:42:27,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2197 transitions. [2022-01-10 01:42:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:42:27,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:27,231 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] [2022-01-10 01:42:27,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 01:42:27,232 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1694810938, now seen corresponding path program 1 times [2022-01-10 01:42:27,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:27,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251595086] [2022-01-10 01:42:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:27,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:27,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:27,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251595086] [2022-01-10 01:42:27,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251595086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:27,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:27,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 01:42:27,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182088307] [2022-01-10 01:42:27,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:27,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 01:42:27,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:27,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 01:42:27,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-10 01:42:27,353 INFO L87 Difference]: Start difference. First operand 1568 states and 2197 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:29,144 INFO L93 Difference]: Finished difference Result 3095 states and 4354 transitions. [2022-01-10 01:42:29,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 01:42:29,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 01:42:29,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:29,149 INFO L225 Difference]: With dead ends: 3095 [2022-01-10 01:42:29,149 INFO L226 Difference]: Without dead ends: 2869 [2022-01-10 01:42:29,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2022-01-10 01:42:29,151 INFO L933 BasicCegarLoop]: 1102 mSDtfsCounter, 6091 mSDsluCounter, 5154 mSDsCounter, 0 mSdLazyCounter, 5143 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6091 SdHoareTripleChecker+Valid, 6256 SdHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 5143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:29,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6091 Valid, 6256 Invalid, 5251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 5143 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 01:42:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2022-01-10 01:42:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1594. [2022-01-10 01:42:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1565 states have (on average 1.428115015974441) internal successors, (2235), 1593 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2235 transitions. [2022-01-10 01:42:29,424 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2235 transitions. Word has length 110 [2022-01-10 01:42:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:29,425 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 2235 transitions. [2022-01-10 01:42:29,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2235 transitions. [2022-01-10 01:42:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 01:42:29,427 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:29,427 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] [2022-01-10 01:42:29,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 01:42:29,427 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1285965710, now seen corresponding path program 1 times [2022-01-10 01:42:29,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:29,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455258623] [2022-01-10 01:42:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:29,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:29,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:29,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455258623] [2022-01-10 01:42:29,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455258623] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:29,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:29,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:29,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482513100] [2022-01-10 01:42:29,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:29,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:29,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:29,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:29,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:29,525 INFO L87 Difference]: Start difference. First operand 1594 states and 2235 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:31,036 INFO L93 Difference]: Finished difference Result 2661 states and 3765 transitions. [2022-01-10 01:42:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 01:42:31,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 01:42:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:31,039 INFO L225 Difference]: With dead ends: 2661 [2022-01-10 01:42:31,039 INFO L226 Difference]: Without dead ends: 2005 [2022-01-10 01:42:31,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2022-01-10 01:42:31,040 INFO L933 BasicCegarLoop]: 981 mSDtfsCounter, 5203 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 3052 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5203 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 3079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:31,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5203 Valid, 3886 Invalid, 3079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3052 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 01:42:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2022-01-10 01:42:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1568. [2022-01-10 01:42:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4262508122157245) internal successors, (2195), 1567 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2195 transitions. [2022-01-10 01:42:31,196 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2195 transitions. Word has length 110 [2022-01-10 01:42:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:31,196 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2195 transitions. [2022-01-10 01:42:31,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2195 transitions. [2022-01-10 01:42:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:31,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:31,198 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] [2022-01-10 01:42:31,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 01:42:31,198 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:31,199 INFO L85 PathProgramCache]: Analyzing trace with hash 230381962, now seen corresponding path program 1 times [2022-01-10 01:42:31,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:31,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475397469] [2022-01-10 01:42:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:31,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:31,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:31,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475397469] [2022-01-10 01:42:31,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475397469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:31,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:31,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:31,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39997993] [2022-01-10 01:42:31,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:31,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:31,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:31,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:31,294 INFO L87 Difference]: Start difference. First operand 1568 states and 2195 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:33,141 INFO L93 Difference]: Finished difference Result 2936 states and 4144 transitions. [2022-01-10 01:42:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:33,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:33,144 INFO L225 Difference]: With dead ends: 2936 [2022-01-10 01:42:33,144 INFO L226 Difference]: Without dead ends: 2741 [2022-01-10 01:42:33,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:33,145 INFO L933 BasicCegarLoop]: 1194 mSDtfsCounter, 5280 mSDsluCounter, 3742 mSDsCounter, 0 mSdLazyCounter, 4052 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5280 SdHoareTripleChecker+Valid, 4936 SdHoareTripleChecker+Invalid, 4141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 4052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:33,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5280 Valid, 4936 Invalid, 4141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 4052 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 01:42:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-01-10 01:42:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1568. [2022-01-10 01:42:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4256010396361274) internal successors, (2194), 1567 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2194 transitions. [2022-01-10 01:42:33,307 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2194 transitions. Word has length 112 [2022-01-10 01:42:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:33,307 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2194 transitions. [2022-01-10 01:42:33,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2194 transitions. [2022-01-10 01:42:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:33,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:33,309 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] [2022-01-10 01:42:33,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 01:42:33,309 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1790606885, now seen corresponding path program 1 times [2022-01-10 01:42:33,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:33,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381523494] [2022-01-10 01:42:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:33,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:33,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:33,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381523494] [2022-01-10 01:42:33,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381523494] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:33,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:33,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:33,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179474427] [2022-01-10 01:42:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:33,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:33,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:33,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:33,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:33,410 INFO L87 Difference]: Start difference. First operand 1568 states and 2194 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:35,489 INFO L93 Difference]: Finished difference Result 2931 states and 4137 transitions. [2022-01-10 01:42:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:35,492 INFO L225 Difference]: With dead ends: 2931 [2022-01-10 01:42:35,492 INFO L226 Difference]: Without dead ends: 2741 [2022-01-10 01:42:35,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:35,493 INFO L933 BasicCegarLoop]: 1176 mSDtfsCounter, 6431 mSDsluCounter, 4811 mSDsCounter, 0 mSdLazyCounter, 4851 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6431 SdHoareTripleChecker+Valid, 5987 SdHoareTripleChecker+Invalid, 4947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 4851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:35,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6431 Valid, 5987 Invalid, 4947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 4851 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 01:42:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-01-10 01:42:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1568. [2022-01-10 01:42:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4249512670565303) internal successors, (2193), 1567 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2193 transitions. [2022-01-10 01:42:35,692 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2193 transitions. Word has length 112 [2022-01-10 01:42:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:35,692 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2193 transitions. [2022-01-10 01:42:35,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2193 transitions. [2022-01-10 01:42:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:35,694 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:35,694 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] [2022-01-10 01:42:35,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 01:42:35,694 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:35,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:35,695 INFO L85 PathProgramCache]: Analyzing trace with hash -403514612, now seen corresponding path program 1 times [2022-01-10 01:42:35,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:35,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549192650] [2022-01-10 01:42:35,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:35,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:35,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:35,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549192650] [2022-01-10 01:42:35,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549192650] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:35,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:35,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:35,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828216773] [2022-01-10 01:42:35,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:35,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:35,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:35,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:35,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:35,798 INFO L87 Difference]: Start difference. First operand 1568 states and 2193 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:37,654 INFO L93 Difference]: Finished difference Result 3086 states and 4359 transitions. [2022-01-10 01:42:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:37,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:37,656 INFO L225 Difference]: With dead ends: 3086 [2022-01-10 01:42:37,656 INFO L226 Difference]: Without dead ends: 2797 [2022-01-10 01:42:37,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:37,657 INFO L933 BasicCegarLoop]: 1351 mSDtfsCounter, 3570 mSDsluCounter, 3974 mSDsCounter, 0 mSdLazyCounter, 4178 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3570 SdHoareTripleChecker+Valid, 5325 SdHoareTripleChecker+Invalid, 4199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:37,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3570 Valid, 5325 Invalid, 4199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4178 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 01:42:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2022-01-10 01:42:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 1568. [2022-01-10 01:42:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.424301494476933) internal successors, (2192), 1567 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2192 transitions. [2022-01-10 01:42:37,838 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2192 transitions. Word has length 112 [2022-01-10 01:42:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:37,838 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2192 transitions. [2022-01-10 01:42:37,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2192 transitions. [2022-01-10 01:42:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:37,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:37,840 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] [2022-01-10 01:42:37,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 01:42:37,840 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:37,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:37,841 INFO L85 PathProgramCache]: Analyzing trace with hash -582562824, now seen corresponding path program 1 times [2022-01-10 01:42:37,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:37,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481699046] [2022-01-10 01:42:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:37,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:37,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:37,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481699046] [2022-01-10 01:42:37,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481699046] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:37,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:37,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:37,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225175506] [2022-01-10 01:42:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:37,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:37,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:37,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:37,935 INFO L87 Difference]: Start difference. First operand 1568 states and 2192 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:39,965 INFO L93 Difference]: Finished difference Result 2936 states and 4139 transitions. [2022-01-10 01:42:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:39,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:39,968 INFO L225 Difference]: With dead ends: 2936 [2022-01-10 01:42:39,968 INFO L226 Difference]: Without dead ends: 2741 [2022-01-10 01:42:39,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:39,969 INFO L933 BasicCegarLoop]: 1194 mSDtfsCounter, 3533 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 4032 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3533 SdHoareTripleChecker+Valid, 4942 SdHoareTripleChecker+Invalid, 4091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:39,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3533 Valid, 4942 Invalid, 4091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4032 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 01:42:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-01-10 01:42:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1568. [2022-01-10 01:42:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.423651721897336) internal successors, (2191), 1567 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2191 transitions. [2022-01-10 01:42:40,179 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2191 transitions. Word has length 112 [2022-01-10 01:42:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:40,179 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2191 transitions. [2022-01-10 01:42:40,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2191 transitions. [2022-01-10 01:42:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:40,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:40,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:42:40,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 01:42:40,181 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:40,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:40,181 INFO L85 PathProgramCache]: Analyzing trace with hash 977250997, now seen corresponding path program 1 times [2022-01-10 01:42:40,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:40,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967194936] [2022-01-10 01:42:40,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:40,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:40,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:40,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967194936] [2022-01-10 01:42:40,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967194936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:40,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:40,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:40,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961539657] [2022-01-10 01:42:40,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:40,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:40,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:40,277 INFO L87 Difference]: Start difference. First operand 1568 states and 2191 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:42,634 INFO L93 Difference]: Finished difference Result 2931 states and 4133 transitions. [2022-01-10 01:42:42,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:42,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:42,637 INFO L225 Difference]: With dead ends: 2931 [2022-01-10 01:42:42,637 INFO L226 Difference]: Without dead ends: 2741 [2022-01-10 01:42:42,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:42,638 INFO L933 BasicCegarLoop]: 1180 mSDtfsCounter, 6414 mSDsluCounter, 4824 mSDsCounter, 0 mSdLazyCounter, 4832 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6414 SdHoareTripleChecker+Valid, 6004 SdHoareTripleChecker+Invalid, 4928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 4832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:42,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6414 Valid, 6004 Invalid, 4928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 4832 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-10 01:42:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-01-10 01:42:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1568. [2022-01-10 01:42:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4230019493177388) internal successors, (2190), 1567 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2190 transitions. [2022-01-10 01:42:42,825 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2190 transitions. Word has length 112 [2022-01-10 01:42:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:42,825 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2190 transitions. [2022-01-10 01:42:42,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2190 transitions. [2022-01-10 01:42:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:42,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:42,827 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] [2022-01-10 01:42:42,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 01:42:42,827 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:42,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1047979927, now seen corresponding path program 1 times [2022-01-10 01:42:42,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:42,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533842699] [2022-01-10 01:42:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:42,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:42,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:42,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533842699] [2022-01-10 01:42:42,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533842699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:42,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:42,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:42,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753889733] [2022-01-10 01:42:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:42,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:42,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:42,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:42,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:42,915 INFO L87 Difference]: Start difference. First operand 1568 states and 2190 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:44,600 INFO L93 Difference]: Finished difference Result 2931 states and 4132 transitions. [2022-01-10 01:42:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:44,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:44,603 INFO L225 Difference]: With dead ends: 2931 [2022-01-10 01:42:44,603 INFO L226 Difference]: Without dead ends: 2741 [2022-01-10 01:42:44,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:44,604 INFO L933 BasicCegarLoop]: 1194 mSDtfsCounter, 5284 mSDsluCounter, 3740 mSDsCounter, 0 mSdLazyCounter, 4026 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5284 SdHoareTripleChecker+Valid, 4934 SdHoareTripleChecker+Invalid, 4115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 4026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:44,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5284 Valid, 4934 Invalid, 4115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 4026 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 01:42:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-01-10 01:42:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1568. [2022-01-10 01:42:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4223521767381417) internal successors, (2189), 1567 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2189 transitions. [2022-01-10 01:42:44,827 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2189 transitions. Word has length 112 [2022-01-10 01:42:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:44,827 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2189 transitions. [2022-01-10 01:42:44,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2189 transitions. [2022-01-10 01:42:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:44,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:44,829 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] [2022-01-10 01:42:44,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 01:42:44,829 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:44,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash -619395701, now seen corresponding path program 1 times [2022-01-10 01:42:44,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:44,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828640489] [2022-01-10 01:42:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:44,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:44,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:44,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828640489] [2022-01-10 01:42:44,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828640489] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:44,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:44,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:44,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898913379] [2022-01-10 01:42:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:44,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:44,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:44,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:44,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:44,927 INFO L87 Difference]: Start difference. First operand 1568 states and 2189 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:47,013 INFO L93 Difference]: Finished difference Result 2929 states and 4128 transitions. [2022-01-10 01:42:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:47,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:47,016 INFO L225 Difference]: With dead ends: 2929 [2022-01-10 01:42:47,017 INFO L226 Difference]: Without dead ends: 2741 [2022-01-10 01:42:47,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:47,018 INFO L933 BasicCegarLoop]: 1116 mSDtfsCounter, 6561 mSDsluCounter, 4648 mSDsCounter, 0 mSdLazyCounter, 4624 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6561 SdHoareTripleChecker+Valid, 5764 SdHoareTripleChecker+Invalid, 4722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:47,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6561 Valid, 5764 Invalid, 4722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4624 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 01:42:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-01-10 01:42:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1568. [2022-01-10 01:42:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4217024041585444) internal successors, (2188), 1567 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2188 transitions. [2022-01-10 01:42:47,220 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2188 transitions. Word has length 112 [2022-01-10 01:42:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:47,220 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2188 transitions. [2022-01-10 01:42:47,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2188 transitions. [2022-01-10 01:42:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:47,221 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:47,221 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] [2022-01-10 01:42:47,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 01:42:47,222 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash -353306795, now seen corresponding path program 1 times [2022-01-10 01:42:47,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:47,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270946248] [2022-01-10 01:42:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:47,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:47,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:47,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270946248] [2022-01-10 01:42:47,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270946248] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:47,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:47,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:47,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512660612] [2022-01-10 01:42:47,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:47,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:47,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:47,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:47,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:47,302 INFO L87 Difference]: Start difference. First operand 1568 states and 2188 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:48,862 INFO L93 Difference]: Finished difference Result 2881 states and 4041 transitions. [2022-01-10 01:42:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:48,865 INFO L225 Difference]: With dead ends: 2881 [2022-01-10 01:42:48,865 INFO L226 Difference]: Without dead ends: 2693 [2022-01-10 01:42:48,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:48,866 INFO L933 BasicCegarLoop]: 967 mSDtfsCounter, 3911 mSDsluCounter, 3130 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3911 SdHoareTripleChecker+Valid, 4097 SdHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:48,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3911 Valid, 4097 Invalid, 3521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3404 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 01:42:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2022-01-10 01:42:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 1568. [2022-01-10 01:42:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4204028589993503) internal successors, (2186), 1567 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2186 transitions. [2022-01-10 01:42:49,085 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2186 transitions. Word has length 112 [2022-01-10 01:42:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:49,086 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2186 transitions. [2022-01-10 01:42:49,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2186 transitions. [2022-01-10 01:42:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:49,087 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:49,087 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] [2022-01-10 01:42:49,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 01:42:49,087 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2030801721, now seen corresponding path program 1 times [2022-01-10 01:42:49,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:49,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918957911] [2022-01-10 01:42:49,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:49,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:49,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:49,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918957911] [2022-01-10 01:42:49,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918957911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:49,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:49,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:49,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235048608] [2022-01-10 01:42:49,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:49,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:49,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:49,167 INFO L87 Difference]: Start difference. First operand 1568 states and 2186 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:50,799 INFO L93 Difference]: Finished difference Result 2881 states and 4037 transitions. [2022-01-10 01:42:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:50,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:50,802 INFO L225 Difference]: With dead ends: 2881 [2022-01-10 01:42:50,802 INFO L226 Difference]: Without dead ends: 2693 [2022-01-10 01:42:50,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:50,803 INFO L933 BasicCegarLoop]: 967 mSDtfsCounter, 5795 mSDsluCounter, 3130 mSDsCounter, 0 mSdLazyCounter, 3399 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5795 SdHoareTripleChecker+Valid, 4097 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 3399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:50,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5795 Valid, 4097 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 3399 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 01:42:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2022-01-10 01:42:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 1568. [2022-01-10 01:42:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4191033138401559) internal successors, (2184), 1567 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2184 transitions. [2022-01-10 01:42:51,016 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2184 transitions. Word has length 112 [2022-01-10 01:42:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:51,017 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2184 transitions. [2022-01-10 01:42:51,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2184 transitions. [2022-01-10 01:42:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:51,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:51,018 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] [2022-01-10 01:42:51,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 01:42:51,019 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:51,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:51,019 INFO L85 PathProgramCache]: Analyzing trace with hash -469685084, now seen corresponding path program 1 times [2022-01-10 01:42:51,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:51,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347127096] [2022-01-10 01:42:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:51,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:51,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:51,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347127096] [2022-01-10 01:42:51,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347127096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:51,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:51,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:51,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412066263] [2022-01-10 01:42:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:51,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:51,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:51,124 INFO L87 Difference]: Start difference. First operand 1568 states and 2184 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:42:53,397 INFO L93 Difference]: Finished difference Result 2951 states and 4152 transitions. [2022-01-10 01:42:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:42:53,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-10 01:42:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:42:53,400 INFO L225 Difference]: With dead ends: 2951 [2022-01-10 01:42:53,400 INFO L226 Difference]: Without dead ends: 2741 [2022-01-10 01:42:53,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:42:53,405 INFO L933 BasicCegarLoop]: 1125 mSDtfsCounter, 6491 mSDsluCounter, 4661 mSDsCounter, 0 mSdLazyCounter, 4623 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6491 SdHoareTripleChecker+Valid, 5786 SdHoareTripleChecker+Invalid, 4721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 01:42:53,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6491 Valid, 5786 Invalid, 4721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4623 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 01:42:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-01-10 01:42:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1568. [2022-01-10 01:42:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4178037686809617) internal successors, (2182), 1567 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2182 transitions. [2022-01-10 01:42:53,622 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2182 transitions. Word has length 112 [2022-01-10 01:42:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:42:53,622 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2182 transitions. [2022-01-10 01:42:53,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:42:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2182 transitions. [2022-01-10 01:42:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:42:53,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:42:53,624 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] [2022-01-10 01:42:53,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 01:42:53,624 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-01-10 01:42:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:42:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash -79489975, now seen corresponding path program 1 times [2022-01-10 01:42:53,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:42:53,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200793873] [2022-01-10 01:42:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:42:53,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:42:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:42:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:42:53,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:42:53,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200793873] [2022-01-10 01:42:53,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200793873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:42:53,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:42:53,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:42:53,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279714382] [2022-01-10 01:42:53,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:42:53,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:42:53,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:42:53,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:42:53,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:42:53,708 INFO L87 Difference]: Start difference. First operand 1568 states and 2182 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)