/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 10:09:11,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 10:09:11,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 10:09:11,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 10:09:11,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 10:09:11,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 10:09:11,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 10:09:11,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 10:09:11,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 10:09:11,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 10:09:11,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 10:09:11,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 10:09:11,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 10:09:11,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 10:09:11,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 10:09:11,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 10:09:11,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 10:09:11,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 10:09:11,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 10:09:11,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 10:09:11,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 10:09:11,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 10:09:11,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 10:09:11,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 10:09:11,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 10:09:11,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 10:09:11,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 10:09:11,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 10:09:11,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 10:09:11,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 10:09:11,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 10:09:11,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 10:09:11,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 10:09:11,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 10:09:11,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 10:09:11,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 10:09:11,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 10:09:11,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 10:09:11,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 10:09:11,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 10:09:11,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 10:09:11,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 10:09:11,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 10:09:11,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 10:09:11,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 10:09:11,653 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 10:09:11,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 10:09:11,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 10:09:11,654 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 10:09:11,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 10:09:11,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 10:09:11,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 10:09:11,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 10:09:11,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 10:09:11,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 10:09:11,655 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 10:09:11,656 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 10:09:11,656 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 10:09:11,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 10:09:11,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 10:09:11,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 10:09:11,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 10:09:11,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 10:09:11,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:09:11,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 10:09:11,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 10:09:11,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 10:09:11,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 10:09:11,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 10:09:11,657 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 10:09:11,657 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 10:09:11,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 10:09:11,658 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 10:09:11,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 10:09:11,658 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 10:09:11,658 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 10:09:11,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 10:09:11,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 10:09:11,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 10:09:11,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 10:09:11,928 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 10:09:11,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label41.c [2022-01-10 10:09:11,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0493ac6e/99a6251eaefc407782a5c583d5bb6b20/FLAGbb275b158 [2022-01-10 10:09:12,474 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 10:09:12,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label41.c [2022-01-10 10:09:12,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0493ac6e/99a6251eaefc407782a5c583d5bb6b20/FLAGbb275b158 [2022-01-10 10:09:12,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0493ac6e/99a6251eaefc407782a5c583d5bb6b20 [2022-01-10 10:09:12,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 10:09:12,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 10:09:12,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 10:09:12,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 10:09:12,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 10:09:12,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:09:12" (1/1) ... [2022-01-10 10:09:12,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c82f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:12, skipping insertion in model container [2022-01-10 10:09:12,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:09:12" (1/1) ... [2022-01-10 10:09:12,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 10:09:12,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 10:09:13,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label41.c[15650,15663] [2022-01-10 10:09:13,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:09:13,211 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 10:09:13,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label41.c[15650,15663] [2022-01-10 10:09:13,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:09:13,322 INFO L208 MainTranslator]: Completed translation [2022-01-10 10:09:13,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13 WrapperNode [2022-01-10 10:09:13,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 10:09:13,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 10:09:13,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 10:09:13,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 10:09:13,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,400 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2022-01-10 10:09:13,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 10:09:13,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 10:09:13,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 10:09:13,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 10:09:13,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 10:09:13,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 10:09:13,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 10:09:13,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 10:09:13,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (1/1) ... [2022-01-10 10:09:13,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:09:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:09:13,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 10:09:13,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 10:09:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 10:09:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 10:09:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 10:09:13,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 10:09:13,625 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 10:09:13,627 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 10:09:14,477 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 10:09:14,489 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 10:09:14,490 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 10:09:14,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:09:14 BoogieIcfgContainer [2022-01-10 10:09:14,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 10:09:14,494 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 10:09:14,494 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 10:09:14,496 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 10:09:14,499 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:09:14" (1/1) ... [2022-01-10 10:09:14,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:09:14 BasicIcfg [2022-01-10 10:09:14,738 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 10:09:14,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 10:09:14,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 10:09:14,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 10:09:14,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 10:09:12" (1/4) ... [2022-01-10 10:09:14,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4569eb57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:09:14, skipping insertion in model container [2022-01-10 10:09:14,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:09:13" (2/4) ... [2022-01-10 10:09:14,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4569eb57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:09:14, skipping insertion in model container [2022-01-10 10:09:14,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:09:14" (3/4) ... [2022-01-10 10:09:14,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4569eb57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:09:14, skipping insertion in model container [2022-01-10 10:09:14,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:09:14" (4/4) ... [2022-01-10 10:09:14,745 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label41.cTransformedIcfg [2022-01-10 10:09:14,749 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 10:09:14,749 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 10:09:14,799 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 10:09:14,806 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 10:09:14,806 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 10:09:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-10 10:09:14,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:14,836 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] [2022-01-10 10:09:14,836 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1806182287, now seen corresponding path program 1 times [2022-01-10 10:09:14,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:14,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509151471] [2022-01-10 10:09:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:14,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:09:15,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:15,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509151471] [2022-01-10 10:09:15,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509151471] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:15,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:15,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:09:15,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69213148] [2022-01-10 10:09:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:15,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:15,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:15,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:15,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:15,310 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:16,103 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2022-01-10 10:09:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-01-10 10:09:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:16,115 INFO L225 Difference]: With dead ends: 630 [2022-01-10 10:09:16,115 INFO L226 Difference]: Without dead ends: 318 [2022-01-10 10:09:16,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:16,121 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 140 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:16,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 10:09:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-01-10 10:09:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-01-10 10:09:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2022-01-10 10:09:16,168 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 90 [2022-01-10 10:09:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:16,169 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2022-01-10 10:09:16,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2022-01-10 10:09:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-10 10:09:16,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:16,178 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:16,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 10:09:16,179 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:16,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:16,181 INFO L85 PathProgramCache]: Analyzing trace with hash -172825548, now seen corresponding path program 1 times [2022-01-10 10:09:16,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:16,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921525570] [2022-01-10 10:09:16,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:16,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:09:16,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:16,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921525570] [2022-01-10 10:09:16,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921525570] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:16,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:16,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:09:16,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3863380] [2022-01-10 10:09:16,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:16,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 10:09:16,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 10:09:16,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:09:16,447 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:17,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:17,287 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2022-01-10 10:09:17,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 10:09:17,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-01-10 10:09:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:17,291 INFO L225 Difference]: With dead ends: 999 [2022-01-10 10:09:17,291 INFO L226 Difference]: Without dead ends: 600 [2022-01-10 10:09:17,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:09:17,293 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 173 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:17,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 113 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 10:09:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-01-10 10:09:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2022-01-10 10:09:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.358931552587646) internal successors, (814), 599 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 814 transitions. [2022-01-10 10:09:17,313 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 814 transitions. Word has length 94 [2022-01-10 10:09:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:17,314 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 814 transitions. [2022-01-10 10:09:17,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 814 transitions. [2022-01-10 10:09:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 10:09:17,317 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:17,317 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:17,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 10:09:17,318 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:17,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1112542845, now seen corresponding path program 1 times [2022-01-10 10:09:17,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:17,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709265331] [2022-01-10 10:09:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:17,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:09:17,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:17,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709265331] [2022-01-10 10:09:17,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709265331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:17,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:17,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 10:09:17,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095792725] [2022-01-10 10:09:17,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:17,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:17,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:17,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:17,388 INFO L87 Difference]: Start difference. First operand 600 states and 814 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 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 10:09:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:17,906 INFO L93 Difference]: Finished difference Result 1764 states and 2397 transitions. [2022-01-10 10:09:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:17,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 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 10:09:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:17,913 INFO L225 Difference]: With dead ends: 1764 [2022-01-10 10:09:17,913 INFO L226 Difference]: Without dead ends: 1166 [2022-01-10 10:09:17,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:17,916 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:17,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 130 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 10:09:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-01-10 10:09:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1164. [2022-01-10 10:09:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.2149613069647462) internal successors, (1413), 1163 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1413 transitions. [2022-01-10 10:09:17,939 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1413 transitions. Word has length 108 [2022-01-10 10:09:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:17,939 INFO L470 AbstractCegarLoop]: Abstraction has 1164 states and 1413 transitions. [2022-01-10 10:09:17,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 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 10:09:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1413 transitions. [2022-01-10 10:09:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 10:09:17,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:17,943 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:17,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 10:09:17,944 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash -780270108, now seen corresponding path program 1 times [2022-01-10 10:09:17,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:17,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867036390] [2022-01-10 10:09:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:17,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:09:18,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:18,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867036390] [2022-01-10 10:09:18,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867036390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:18,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:18,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:09:18,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924956609] [2022-01-10 10:09:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:18,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:18,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:18,020 INFO L87 Difference]: Start difference. First operand 1164 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:18,548 INFO L93 Difference]: Finished difference Result 2890 states and 3593 transitions. [2022-01-10 10:09:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:18,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2022-01-10 10:09:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:18,554 INFO L225 Difference]: With dead ends: 2890 [2022-01-10 10:09:18,554 INFO L226 Difference]: Without dead ends: 1728 [2022-01-10 10:09:18,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:18,557 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:18,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 53 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 10:09:18,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-01-10 10:09:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1724. [2022-01-10 10:09:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.2385374347069065) internal successors, (2134), 1723 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2134 transitions. [2022-01-10 10:09:18,585 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2134 transitions. Word has length 113 [2022-01-10 10:09:18,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:18,585 INFO L470 AbstractCegarLoop]: Abstraction has 1724 states and 2134 transitions. [2022-01-10 10:09:18,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2134 transitions. [2022-01-10 10:09:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 10:09:18,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:18,588 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:18,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 10:09:18,588 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2037548000, now seen corresponding path program 1 times [2022-01-10 10:09:18,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:18,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029444036] [2022-01-10 10:09:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:18,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 10:09:18,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:18,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029444036] [2022-01-10 10:09:18,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029444036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:18,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:18,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:09:18,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624180089] [2022-01-10 10:09:18,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:18,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:18,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:18,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:18,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:18,697 INFO L87 Difference]: Start difference. First operand 1724 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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 10:09:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:19,206 INFO L93 Difference]: Finished difference Result 4006 states and 5011 transitions. [2022-01-10 10:09:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:19,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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 117 [2022-01-10 10:09:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:19,212 INFO L225 Difference]: With dead ends: 4006 [2022-01-10 10:09:19,213 INFO L226 Difference]: Without dead ends: 1577 [2022-01-10 10:09:19,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:19,216 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 56 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:19,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 276 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 10:09:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-01-10 10:09:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1577. [2022-01-10 10:09:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1576 states have (on average 1.1884517766497462) internal successors, (1873), 1576 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 1873 transitions. [2022-01-10 10:09:19,241 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 1873 transitions. Word has length 117 [2022-01-10 10:09:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:19,242 INFO L470 AbstractCegarLoop]: Abstraction has 1577 states and 1873 transitions. [2022-01-10 10:09:19,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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 10:09:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1873 transitions. [2022-01-10 10:09:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-10 10:09:19,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:19,245 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:19,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 10:09:19,245 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:19,245 INFO L85 PathProgramCache]: Analyzing trace with hash 386652485, now seen corresponding path program 1 times [2022-01-10 10:09:19,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:19,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819624592] [2022-01-10 10:09:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:19,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 10:09:19,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819624592] [2022-01-10 10:09:19,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819624592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:19,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:19,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:09:19,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359788034] [2022-01-10 10:09:19,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:19,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:19,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:19,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:19,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:19,319 INFO L87 Difference]: Start difference. First operand 1577 states and 1873 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:19,773 INFO L93 Difference]: Finished difference Result 4279 states and 5077 transitions. [2022-01-10 10:09:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:19,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 128 [2022-01-10 10:09:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:19,781 INFO L225 Difference]: With dead ends: 4279 [2022-01-10 10:09:19,781 INFO L226 Difference]: Without dead ends: 2424 [2022-01-10 10:09:19,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:19,785 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 137 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:19,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 255 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 10:09:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2022-01-10 10:09:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2416. [2022-01-10 10:09:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2415 states have (on average 1.158592132505176) internal successors, (2798), 2415 states have internal predecessors, (2798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 2798 transitions. [2022-01-10 10:09:19,834 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 2798 transitions. Word has length 128 [2022-01-10 10:09:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:19,834 INFO L470 AbstractCegarLoop]: Abstraction has 2416 states and 2798 transitions. [2022-01-10 10:09:19,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2798 transitions. [2022-01-10 10:09:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-10 10:09:19,838 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:19,838 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:19,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 10:09:19,838 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:19,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash -282778614, now seen corresponding path program 1 times [2022-01-10 10:09:19,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:19,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487294632] [2022-01-10 10:09:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:19,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 10:09:19,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:19,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487294632] [2022-01-10 10:09:19,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487294632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:19,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:19,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:09:19,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656893398] [2022-01-10 10:09:19,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:19,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:19,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:19,908 INFO L87 Difference]: Start difference. First operand 2416 states and 2798 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:20,313 INFO L93 Difference]: Finished difference Result 4836 states and 5604 transitions. [2022-01-10 10:09:20,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:20,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 142 [2022-01-10 10:09:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:20,321 INFO L225 Difference]: With dead ends: 4836 [2022-01-10 10:09:20,321 INFO L226 Difference]: Without dead ends: 2421 [2022-01-10 10:09:20,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:20,324 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 132 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:20,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 96 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 10:09:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2022-01-10 10:09:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2414. [2022-01-10 10:09:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2413 states have (on average 1.1342726895980109) internal successors, (2737), 2413 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2737 transitions. [2022-01-10 10:09:20,358 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2737 transitions. Word has length 142 [2022-01-10 10:09:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:20,359 INFO L470 AbstractCegarLoop]: Abstraction has 2414 states and 2737 transitions. [2022-01-10 10:09:20,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2737 transitions. [2022-01-10 10:09:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-10 10:09:20,362 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:20,362 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:20,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 10:09:20,362 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:20,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash 577117578, now seen corresponding path program 1 times [2022-01-10 10:09:20,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:20,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243376028] [2022-01-10 10:09:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:20,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-10 10:09:20,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:20,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243376028] [2022-01-10 10:09:20,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243376028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:20,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:20,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 10:09:20,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599638895] [2022-01-10 10:09:20,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:20,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 10:09:20,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:20,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 10:09:20,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 10:09:20,497 INFO L87 Difference]: Start difference. First operand 2414 states and 2737 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:21,306 INFO L93 Difference]: Finished difference Result 4871 states and 5517 transitions. [2022-01-10 10:09:21,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 10:09:21,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 150 [2022-01-10 10:09:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:21,314 INFO L225 Difference]: With dead ends: 4871 [2022-01-10 10:09:21,314 INFO L226 Difference]: Without dead ends: 2459 [2022-01-10 10:09:21,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 10:09:21,318 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 417 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:21,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 101 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 10:09:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2022-01-10 10:09:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2414. [2022-01-10 10:09:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2413 states have (on average 1.1230832987981765) internal successors, (2710), 2413 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2710 transitions. [2022-01-10 10:09:21,365 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2710 transitions. Word has length 150 [2022-01-10 10:09:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:21,369 INFO L470 AbstractCegarLoop]: Abstraction has 2414 states and 2710 transitions. [2022-01-10 10:09:21,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2710 transitions. [2022-01-10 10:09:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-10 10:09:21,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:21,373 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:21,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 10:09:21,373 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:21,374 INFO L85 PathProgramCache]: Analyzing trace with hash 500255439, now seen corresponding path program 1 times [2022-01-10 10:09:21,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:21,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723916820] [2022-01-10 10:09:21,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:21,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 10:09:21,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:21,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723916820] [2022-01-10 10:09:21,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723916820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:21,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:21,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:09:21,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695265684] [2022-01-10 10:09:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:21,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:21,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:21,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:21,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:21,496 INFO L87 Difference]: Start difference. First operand 2414 states and 2710 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:21,938 INFO L93 Difference]: Finished difference Result 5671 states and 6424 transitions. [2022-01-10 10:09:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-01-10 10:09:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:21,950 INFO L225 Difference]: With dead ends: 5671 [2022-01-10 10:09:21,951 INFO L226 Difference]: Without dead ends: 3259 [2022-01-10 10:09:21,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:21,956 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 134 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:21,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 206 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 10:09:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2022-01-10 10:09:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 3257. [2022-01-10 10:09:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3257 states, 3256 states have (on average 1.1173218673218672) internal successors, (3638), 3256 states have internal predecessors, (3638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 3638 transitions. [2022-01-10 10:09:22,011 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 3638 transitions. Word has length 172 [2022-01-10 10:09:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:22,011 INFO L470 AbstractCegarLoop]: Abstraction has 3257 states and 3638 transitions. [2022-01-10 10:09:22,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 3638 transitions. [2022-01-10 10:09:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-01-10 10:09:22,016 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:22,017 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:22,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 10:09:22,017 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:22,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:22,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1658795499, now seen corresponding path program 1 times [2022-01-10 10:09:22,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:22,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742712451] [2022-01-10 10:09:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:22,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-10 10:09:22,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:22,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742712451] [2022-01-10 10:09:22,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742712451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:22,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:22,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 10:09:22,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851359915] [2022-01-10 10:09:22,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:22,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 10:09:22,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:22,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 10:09:22,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 10:09:22,179 INFO L87 Difference]: Start difference. First operand 3257 states and 3638 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:23,017 INFO L93 Difference]: Finished difference Result 7144 states and 7948 transitions. [2022-01-10 10:09:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 10:09:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2022-01-10 10:09:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:23,026 INFO L225 Difference]: With dead ends: 7144 [2022-01-10 10:09:23,026 INFO L226 Difference]: Without dead ends: 3178 [2022-01-10 10:09:23,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 10:09:23,031 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 334 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:23,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 104 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 10:09:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2022-01-10 10:09:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2975. [2022-01-10 10:09:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 1.0770006724949563) internal successors, (3203), 2974 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 3203 transitions. [2022-01-10 10:09:23,079 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 3203 transitions. Word has length 231 [2022-01-10 10:09:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:23,079 INFO L470 AbstractCegarLoop]: Abstraction has 2975 states and 3203 transitions. [2022-01-10 10:09:23,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3203 transitions. [2022-01-10 10:09:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-01-10 10:09:23,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:23,085 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:23,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 10:09:23,086 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1204879884, now seen corresponding path program 1 times [2022-01-10 10:09:23,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:23,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858478711] [2022-01-10 10:09:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:23,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-01-10 10:09:23,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:23,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858478711] [2022-01-10 10:09:23,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858478711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:23,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:23,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 10:09:23,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772035590] [2022-01-10 10:09:23,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:23,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 10:09:23,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:23,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 10:09:23,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:09:23,220 INFO L87 Difference]: Start difference. First operand 2975 states and 3203 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:23,848 INFO L93 Difference]: Finished difference Result 6234 states and 6711 transitions. [2022-01-10 10:09:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 10:09:23,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2022-01-10 10:09:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:23,855 INFO L225 Difference]: With dead ends: 6234 [2022-01-10 10:09:23,856 INFO L226 Difference]: Without dead ends: 3121 [2022-01-10 10:09:23,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 10:09:23,859 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 260 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:23,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 240 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 10:09:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2022-01-10 10:09:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 3115. [2022-01-10 10:09:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3115 states, 3114 states have (on average 1.069043031470777) internal successors, (3329), 3114 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:23,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 3329 transitions. [2022-01-10 10:09:23,905 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 3329 transitions. Word has length 241 [2022-01-10 10:09:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:23,905 INFO L470 AbstractCegarLoop]: Abstraction has 3115 states and 3329 transitions. [2022-01-10 10:09:23,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 3329 transitions. [2022-01-10 10:09:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-01-10 10:09:23,910 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:23,911 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:23,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 10:09:23,911 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash 373720337, now seen corresponding path program 1 times [2022-01-10 10:09:23,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:23,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127490583] [2022-01-10 10:09:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:23,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-10 10:09:24,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:24,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127490583] [2022-01-10 10:09:24,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127490583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:24,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:24,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:09:24,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627851469] [2022-01-10 10:09:24,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:24,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:24,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:24,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:24,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:24,034 INFO L87 Difference]: Start difference. First operand 3115 states and 3329 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:24,476 INFO L93 Difference]: Finished difference Result 6792 states and 7260 transitions. [2022-01-10 10:09:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 249 [2022-01-10 10:09:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:24,489 INFO L225 Difference]: With dead ends: 6792 [2022-01-10 10:09:24,489 INFO L226 Difference]: Without dead ends: 3679 [2022-01-10 10:09:24,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:24,492 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 113 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:24,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 222 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 10:09:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2022-01-10 10:09:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3537. [2022-01-10 10:09:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 3536 states have (on average 1.0684389140271493) internal successors, (3778), 3536 states have internal predecessors, (3778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 3778 transitions. [2022-01-10 10:09:24,567 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 3778 transitions. Word has length 249 [2022-01-10 10:09:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:24,567 INFO L470 AbstractCegarLoop]: Abstraction has 3537 states and 3778 transitions. [2022-01-10 10:09:24,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 3778 transitions. [2022-01-10 10:09:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-01-10 10:09:24,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:24,573 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:24,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 10:09:24,574 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:24,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2070702542, now seen corresponding path program 1 times [2022-01-10 10:09:24,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:24,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572598032] [2022-01-10 10:09:24,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:24,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-01-10 10:09:24,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:24,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572598032] [2022-01-10 10:09:24,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572598032] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:24,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:24,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:09:24,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069407650] [2022-01-10 10:09:24,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:24,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:24,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:24,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:24,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:24,684 INFO L87 Difference]: Start difference. First operand 3537 states and 3778 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:25,084 INFO L93 Difference]: Finished difference Result 7773 states and 8305 transitions. [2022-01-10 10:09:25,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:25,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 254 [2022-01-10 10:09:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:25,094 INFO L225 Difference]: With dead ends: 7773 [2022-01-10 10:09:25,095 INFO L226 Difference]: Without dead ends: 3956 [2022-01-10 10:09:25,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:25,098 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 155 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:25,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 66 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 10:09:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2022-01-10 10:09:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3816. [2022-01-10 10:09:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3816 states, 3815 states have (on average 1.0623853211009173) internal successors, (4053), 3815 states have internal predecessors, (4053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 3816 states and 4053 transitions. [2022-01-10 10:09:25,165 INFO L78 Accepts]: Start accepts. Automaton has 3816 states and 4053 transitions. Word has length 254 [2022-01-10 10:09:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:25,165 INFO L470 AbstractCegarLoop]: Abstraction has 3816 states and 4053 transitions. [2022-01-10 10:09:25,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3816 states and 4053 transitions. [2022-01-10 10:09:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-01-10 10:09:25,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:09:25,186 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:25,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 10:09:25,186 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:09:25,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:09:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1726246628, now seen corresponding path program 1 times [2022-01-10 10:09:25,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:09:25,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879954787] [2022-01-10 10:09:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:09:25,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:09:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:09:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-01-10 10:09:25,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:09:25,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879954787] [2022-01-10 10:09:25,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879954787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:09:25,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:09:25,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:09:25,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810864349] [2022-01-10 10:09:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:09:25,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:09:25,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:09:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:09:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:25,365 INFO L87 Difference]: Start difference. First operand 3816 states and 4053 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:09:25,691 INFO L93 Difference]: Finished difference Result 6214 states and 6595 transitions. [2022-01-10 10:09:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:09:25,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2022-01-10 10:09:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:09:25,692 INFO L225 Difference]: With dead ends: 6214 [2022-01-10 10:09:25,692 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 10:09:25,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:09:25,695 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 10:09:25,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 180 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 10:09:25,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 10:09:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 10:09:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 10:09:25,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2022-01-10 10:09:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:09:25,696 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 10:09:25,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:09:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 10:09:25,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 10:09:25,698 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 10:09:25,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 10:09:25,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 10:09:27,111 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 10:09:27,111 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 10:09:27,111 INFO L854 garLoopResultBuilder]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse13 (= ~a11~0Int 1)) (.cse11 (= ~a25~0Int 1))) (let ((.cse0 (not .cse11)) (.cse10 (<= ~a25~0Int 0)) (.cse6 (<= 10 ~a28~0Int)) (.cse9 (<= ~a28~0Int 7)) (.cse8 (<= ~a19~0Int 0)) (.cse12 (<= 9 ~a28~0Int)) (.cse7 (= ~a11~0Int 0)) (.cse4 (<= ~a28~0Int 10)) (.cse1 (= ~a21~0Int 1)) (.cse2 (= ~a17~0Int 8)) (.cse3 (not .cse13)) (.cse5 (= ~a19~0Int 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a28~0Int 10) .cse5) (and .cse6 .cse7 .cse4 .cse8) (and .cse0 .cse4 .cse8) (and .cse1 .cse2 .cse7 .cse9 .cse5) (and .cse7 .cse10 .cse8) (<= ~a17~0Int 7) (and .cse9 .cse11 .cse5) (and .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse12 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse6 .cse4 .cse11 .cse5) (and .cse9 .cse8) (and .cse12 .cse1 .cse2 .cse7 .cse4 .cse5) (and .cse13 (= 9 ~a28~0Int) .cse1 .cse2 .cse11 .cse5) (and .cse1 .cse2 (not (= |ULTIMATE.start_ULTIMATE.start_calculate_output_~input#1Int| 3)) .cse3 (= ~a28~0Int 11) .cse11 .cse5)))) [2022-01-10 10:09:27,111 INFO L861 garLoopResultBuilder]: At program point L610(lines 610 627) the Hoare annotation is: true [2022-01-10 10:09:27,111 INFO L858 garLoopResultBuilder]: For program point L621(line 621) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L854 garLoopResultBuilder]: At program point L607(lines 39 608) the Hoare annotation is: (let ((.cse13 (= ~a11~0Int 1)) (.cse11 (= ~a25~0Int 1))) (let ((.cse0 (not .cse11)) (.cse10 (<= ~a25~0Int 0)) (.cse6 (<= 10 ~a28~0Int)) (.cse9 (<= ~a28~0Int 7)) (.cse8 (<= ~a19~0Int 0)) (.cse12 (<= 9 ~a28~0Int)) (.cse7 (= ~a11~0Int 0)) (.cse4 (<= ~a28~0Int 10)) (.cse1 (= ~a21~0Int 1)) (.cse2 (= ~a17~0Int 8)) (.cse3 (not .cse13)) (.cse5 (= ~a19~0Int 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a28~0Int 10) .cse5) (and .cse6 .cse7 .cse4 .cse8) (and .cse0 .cse4 .cse8) (and .cse1 .cse2 .cse7 .cse9 .cse5) (and .cse7 .cse10 .cse8) (<= ~a17~0Int 7) (and .cse9 .cse11 .cse5) (and .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse12 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse6 .cse4 .cse11 .cse5) (and .cse9 .cse8) (and .cse12 .cse1 .cse2 .cse7 .cse4 .cse5) (and .cse13 (= 9 ~a28~0Int) .cse1 .cse2 .cse11 .cse5) (and .cse1 .cse2 (not (= |ULTIMATE.start_ULTIMATE.start_calculate_output_~input#1Int| 3)) .cse3 (= ~a28~0Int 11) .cse11 .cse5)))) [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L57(lines 57 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L79(lines 79 423) no Hoare annotation was computed. [2022-01-10 10:09:27,113 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L85-2(lines 85 90) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L93-2(lines 93 99) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 423) no Hoare annotation was computed. [2022-01-10 10:09:27,114 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L201(lines 201 423) no Hoare annotation was computed. [2022-01-10 10:09:27,115 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 220) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L213-2(lines 213 220) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L225(lines 225 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L235(lines 235 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L244(lines 244 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L247(lines 247 423) no Hoare annotation was computed. [2022-01-10 10:09:27,116 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 256) no Hoare annotation was computed. [2022-01-10 10:09:27,117 INFO L858 garLoopResultBuilder]: For program point L258(lines 258 423) no Hoare annotation was computed. [2022-01-10 10:09:27,117 INFO L858 garLoopResultBuilder]: For program point L248-2(lines 248 256) no Hoare annotation was computed. [2022-01-10 10:09:27,117 INFO L858 garLoopResultBuilder]: For program point L263(lines 263 423) no Hoare annotation was computed. [2022-01-10 10:09:27,117 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 423) no Hoare annotation was computed. [2022-01-10 10:09:27,117 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 423) no Hoare annotation was computed. [2022-01-10 10:09:27,118 INFO L858 garLoopResultBuilder]: For program point L272(lines 272 284) no Hoare annotation was computed. [2022-01-10 10:09:27,119 INFO L858 garLoopResultBuilder]: For program point L286(lines 286 423) no Hoare annotation was computed. [2022-01-10 10:09:27,119 INFO L858 garLoopResultBuilder]: For program point L272-2(lines 272 284) no Hoare annotation was computed. [2022-01-10 10:09:27,119 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 423) no Hoare annotation was computed. [2022-01-10 10:09:27,119 INFO L858 garLoopResultBuilder]: For program point L293(lines 293 423) no Hoare annotation was computed. [2022-01-10 10:09:27,119 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 423) no Hoare annotation was computed. [2022-01-10 10:09:27,119 INFO L858 garLoopResultBuilder]: For program point L301(lines 301 423) no Hoare annotation was computed. [2022-01-10 10:09:27,120 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 423) no Hoare annotation was computed. [2022-01-10 10:09:27,120 INFO L858 garLoopResultBuilder]: For program point L307(lines 307 423) no Hoare annotation was computed. [2022-01-10 10:09:27,120 INFO L858 garLoopResultBuilder]: For program point L308(lines 308 317) no Hoare annotation was computed. [2022-01-10 10:09:27,120 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 423) no Hoare annotation was computed. [2022-01-10 10:09:27,120 INFO L858 garLoopResultBuilder]: For program point L308-2(lines 308 317) no Hoare annotation was computed. [2022-01-10 10:09:27,120 INFO L858 garLoopResultBuilder]: For program point L324(lines 324 423) no Hoare annotation was computed. [2022-01-10 10:09:27,120 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 336) no Hoare annotation was computed. [2022-01-10 10:09:27,120 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 423) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L325-2(lines 325 336) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 423) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L342(lines 342 345) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 423) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L342-2(lines 342 345) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 357) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 423) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L348-2(lines 348 357) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 423) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 423) no Hoare annotation was computed. [2022-01-10 10:09:27,121 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L385(lines 385 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L390(lines 390 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L391(lines 391 397) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L391-2(lines 391 397) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L404(lines 404 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L408(lines 408 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L412(lines 412 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L419(lines 419 423) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L424(lines 424 426) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L425(line 425) no Hoare annotation was computed. [2022-01-10 10:09:27,122 INFO L858 garLoopResultBuilder]: For program point L424-2(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L427-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L431(line 431) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L430-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L434(line 434) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L433-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L437(line 437) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L436-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L440(line 440) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L439-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L443(line 443) no Hoare annotation was computed. [2022-01-10 10:09:27,123 INFO L858 garLoopResultBuilder]: For program point L442-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,124 INFO L858 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-01-10 10:09:27,124 INFO L858 garLoopResultBuilder]: For program point L445-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,124 INFO L858 garLoopResultBuilder]: For program point L449(line 449) no Hoare annotation was computed. [2022-01-10 10:09:27,125 INFO L858 garLoopResultBuilder]: For program point L448-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,125 INFO L858 garLoopResultBuilder]: For program point L452(line 452) no Hoare annotation was computed. [2022-01-10 10:09:27,125 INFO L858 garLoopResultBuilder]: For program point L451-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 452) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L455(line 455) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L454-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L458(line 458) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L457-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L461(line 461) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L460-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L464(line 464) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L463-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L467(line 467) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L466-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L469-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,126 INFO L858 garLoopResultBuilder]: For program point L473(line 473) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L472-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L476(line 476) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L475-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L478-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L482(line 482) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L481-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L485(line 485) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L484-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L488(line 488) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L487-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L491(line 491) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L490-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,127 INFO L858 garLoopResultBuilder]: For program point L494(line 494) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L493-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L497(line 497) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L496-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L499-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L503(line 503) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L502-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L506(line 506) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L505-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L509(line 509) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L508-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L512(line 512) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L511-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L515(line 515) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L514-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,128 INFO L858 garLoopResultBuilder]: For program point L518(line 518) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L517-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L521(line 521) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L520-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L524(line 524) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L523-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L527(line 527) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L526-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L530(line 530) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L529-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L533(line 533) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L532-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,129 INFO L858 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L535-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L539(line 539) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L538-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L541-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L545(line 545) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L544-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L548(line 548) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L547-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L551(line 551) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L550-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L554(line 554) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L553-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L557(line 557) no Hoare annotation was computed. [2022-01-10 10:09:27,130 INFO L858 garLoopResultBuilder]: For program point L556-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,131 INFO L858 garLoopResultBuilder]: For program point L560(line 560) no Hoare annotation was computed. [2022-01-10 10:09:27,131 INFO L858 garLoopResultBuilder]: For program point L559-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,131 INFO L858 garLoopResultBuilder]: For program point L563(line 563) no Hoare annotation was computed. [2022-01-10 10:09:27,131 INFO L858 garLoopResultBuilder]: For program point L562-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,132 INFO L858 garLoopResultBuilder]: For program point L566(line 566) no Hoare annotation was computed. [2022-01-10 10:09:27,132 INFO L858 garLoopResultBuilder]: For program point L565-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,132 INFO L858 garLoopResultBuilder]: For program point L569(line 569) no Hoare annotation was computed. [2022-01-10 10:09:27,132 INFO L858 garLoopResultBuilder]: For program point L568-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L571-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L575(line 575) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L574-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L578(line 578) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L577-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L581(line 581) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L580-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L584(line 584) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L583-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L587(line 587) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L586-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2022-01-10 10:09:27,133 INFO L858 garLoopResultBuilder]: For program point L589-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L593(line 593) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L592-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L596(line 596) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L595-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L598-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L601-1(lines 39 608) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L605(line 605) no Hoare annotation was computed. [2022-01-10 10:09:27,134 INFO L858 garLoopResultBuilder]: For program point L604-1(lines 604 606) no Hoare annotation was computed. [2022-01-10 10:09:27,138 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:09:27,140 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 10:09:27,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:09:27 BasicIcfg [2022-01-10 10:09:27,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 10:09:27,178 INFO L158 Benchmark]: Toolchain (without parser) took 14400.36ms. Allocated memory was 177.2MB in the beginning and 319.8MB in the end (delta: 142.6MB). Free memory was 124.7MB in the beginning and 249.1MB in the end (delta: -124.5MB). Peak memory consumption was 178.5MB. Max. memory is 8.0GB. [2022-01-10 10:09:27,178 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 10:09:27,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.40ms. Allocated memory is still 177.2MB. Free memory was 124.5MB in the beginning and 136.4MB in the end (delta: -11.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 10:09:27,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.81ms. Allocated memory is still 177.2MB. Free memory was 136.4MB in the beginning and 131.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 10:09:27,179 INFO L158 Benchmark]: Boogie Preprocessor took 72.23ms. Allocated memory is still 177.2MB. Free memory was 130.6MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 10:09:27,179 INFO L158 Benchmark]: RCFGBuilder took 1014.97ms. Allocated memory is still 177.2MB. Free memory was 126.5MB in the beginning and 68.8MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2022-01-10 10:09:27,179 INFO L158 Benchmark]: IcfgTransformer took 244.13ms. Allocated memory was 177.2MB in the beginning and 216.0MB in the end (delta: 38.8MB). Free memory was 68.8MB in the beginning and 165.3MB in the end (delta: -96.6MB). Peak memory consumption was 23.0MB. Max. memory is 8.0GB. [2022-01-10 10:09:27,179 INFO L158 Benchmark]: TraceAbstraction took 12437.52ms. Allocated memory was 216.0MB in the beginning and 319.8MB in the end (delta: 103.8MB). Free memory was 164.8MB in the beginning and 249.1MB in the end (delta: -84.3MB). Peak memory consumption was 178.7MB. Max. memory is 8.0GB. [2022-01-10 10:09:27,181 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 543.40ms. Allocated memory is still 177.2MB. Free memory was 124.5MB in the beginning and 136.4MB in the end (delta: -11.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.81ms. Allocated memory is still 177.2MB. Free memory was 136.4MB in the beginning and 131.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.23ms. Allocated memory is still 177.2MB. Free memory was 130.6MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1014.97ms. Allocated memory is still 177.2MB. Free memory was 126.5MB in the beginning and 68.8MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * IcfgTransformer took 244.13ms. Allocated memory was 177.2MB in the beginning and 216.0MB in the end (delta: 38.8MB). Free memory was 68.8MB in the beginning and 165.3MB in the end (delta: -96.6MB). Peak memory consumption was 23.0MB. Max. memory is 8.0GB. * TraceAbstraction took 12437.52ms. Allocated memory was 216.0MB in the beginning and 319.8MB in the end (delta: 103.8MB). Free memory was 164.8MB in the beginning and 249.1MB in the end (delta: -84.3MB). Peak memory consumption was 178.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 452]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2450 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2450 mSDsluCounter, 2161 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 314 mSDsCounter, 1002 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6516 IncrementalHoareTripleChecker+Invalid, 7518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1002 mSolverCounterUnsat, 1847 mSDtfsCounter, 6516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3816occurred in iteration=13, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 559 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 77 NumberOfFragments, 413 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1340 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4088 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2362 NumberOfCodeBlocks, 2362 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2348 ConstructedInterpolants, 0 QuantifiedInterpolants, 7743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2020/2020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((((((((((((1bv32 == a19 && ~bvule32(a25, 0bv32)) && ~bvule32(a28, 10bv32)) && ~bvule32(9bv32, a28)) && !(1bv32 == a25)) && 1bv32 == a21) && 8bv32 == a17) || ((((((!(3bv32 == input) && 1bv32 == a25) && !(1bv32 == a11)) && 1bv32 == a19) && 11bv32 == a28) && 1bv32 == a21) && 8bv32 == a17)) || ((~bvule32(a28, 10bv32) && ~bvule32(a19, 0bv32)) && !(1bv32 == a25))) || (((~bvule32(10bv32, a28) && 0bv32 == a11) && ~bvule32(a28, 10bv32)) && ~bvule32(a19, 0bv32))) || (~bvule32(a19, 0bv32) && ~bvule32(a28, 7bv32))) || ((1bv32 == a25 && 1bv32 == a19) && ~bvule32(a28, 7bv32))) || (((1bv32 == a25 && 1bv32 == a19) && 0bv32 == a11) && ~bvule32(a28, 10bv32))) || (((((1bv32 == a11 && 1bv32 == a25) && 1bv32 == a19) && a28 == 9bv32) && 1bv32 == a21) && 8bv32 == a17)) || ((~bvule32(a25, 0bv32) && 0bv32 == a11) && ~bvule32(a19, 0bv32))) || ~bvule32(a17, 7bv32)) || (((((1bv32 == a19 && 0bv32 == a11) && ~bvule32(a28, 10bv32)) && ~bvule32(9bv32, a28)) && 1bv32 == a21) && 8bv32 == a17)) || ((((1bv32 == a19 && 0bv32 == a11) && ~bvule32(a28, 7bv32)) && 1bv32 == a21) && 8bv32 == a17)) || (((~bvule32(10bv32, a28) && 1bv32 == a25) && 1bv32 == a19) && ~bvule32(a28, 10bv32))) || ((((((!(1bv32 == a11) && 1bv32 == a19) && 10bv32 == a28) && ~bvule32(a28, 10bv32)) && !(1bv32 == a25)) && 1bv32 == a21) && 8bv32 == a17) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((1bv32 == a19 && ~bvule32(a25, 0bv32)) && ~bvule32(a28, 10bv32)) && ~bvule32(9bv32, a28)) && !(1bv32 == a25)) && 1bv32 == a21) && 8bv32 == a17) || ((((((!(3bv32 == input) && 1bv32 == a25) && !(1bv32 == a11)) && 1bv32 == a19) && 11bv32 == a28) && 1bv32 == a21) && 8bv32 == a17)) || ((~bvule32(a28, 10bv32) && ~bvule32(a19, 0bv32)) && !(1bv32 == a25))) || (((~bvule32(10bv32, a28) && 0bv32 == a11) && ~bvule32(a28, 10bv32)) && ~bvule32(a19, 0bv32))) || (~bvule32(a19, 0bv32) && ~bvule32(a28, 7bv32))) || ((1bv32 == a25 && 1bv32 == a19) && ~bvule32(a28, 7bv32))) || (((1bv32 == a25 && 1bv32 == a19) && 0bv32 == a11) && ~bvule32(a28, 10bv32))) || (((((1bv32 == a11 && 1bv32 == a25) && 1bv32 == a19) && a28 == 9bv32) && 1bv32 == a21) && 8bv32 == a17)) || ((~bvule32(a25, 0bv32) && 0bv32 == a11) && ~bvule32(a19, 0bv32))) || ~bvule32(a17, 7bv32)) || (((((1bv32 == a19 && 0bv32 == a11) && ~bvule32(a28, 10bv32)) && ~bvule32(9bv32, a28)) && 1bv32 == a21) && 8bv32 == a17)) || ((((1bv32 == a19 && 0bv32 == a11) && ~bvule32(a28, 7bv32)) && 1bv32 == a21) && 8bv32 == a17)) || (((~bvule32(10bv32, a28) && 1bv32 == a25) && 1bv32 == a19) && ~bvule32(a28, 10bv32))) || ((((((!(1bv32 == a11) && 1bv32 == a19) && 10bv32 == a28) && ~bvule32(a28, 10bv32)) && !(1bv32 == a25)) && 1bv32 == a21) && 8bv32 == a17) RESULT: Ultimate proved your program to be correct! [2022-01-10 10:09:27,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...