/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/openssl-simplified/s3_clnt_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 10:02:30,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 10:02:30,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 10:02:30,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 10:02:30,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 10:02:30,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 10:02:30,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 10:02:30,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 10:02:30,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 10:02:30,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 10:02:30,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 10:02:30,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 10:02:30,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 10:02:30,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 10:02:30,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 10:02:30,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 10:02:30,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 10:02:30,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 10:02:30,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 10:02:30,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 10:02:30,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 10:02:30,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 10:02:30,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 10:02:30,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 10:02:30,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 10:02:30,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 10:02:30,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 10:02:30,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 10:02:30,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 10:02:30,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 10:02:30,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 10:02:30,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 10:02:30,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 10:02:30,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 10:02:30,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 10:02:30,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 10:02:30,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 10:02:30,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 10:02:30,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 10:02:30,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 10:02:30,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 10:02:30,571 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:02:30,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 10:02:30,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 10:02:30,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 10:02:30,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 10:02:30,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 10:02:30,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 10:02:30,595 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 10:02:30,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 10:02:30,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 10:02:30,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 10:02:30,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 10:02:30,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 10:02:30,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 10:02:30,597 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 10:02:30,597 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 10:02:30,597 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 10:02:30,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 10:02:30,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 10:02:30,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 10:02:30,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 10:02:30,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 10:02:30,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:02:30,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 10:02:30,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 10:02:30,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 10:02:30,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 10:02:30,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 10:02:30,599 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 10:02:30,600 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 10:02:30,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 10:02:30,600 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 10:02:30,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 10:02:30,601 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 10:02:30,601 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:02:30,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 10:02:30,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 10:02:30,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 10:02:30,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 10:02:30,843 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 10:02:30,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c [2022-01-10 10:02:30,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3514e31a/884d57126a2f4579a0d75383ba5167ba/FLAG797ab9abf [2022-01-10 10:02:31,290 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 10:02:31,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c [2022-01-10 10:02:31,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3514e31a/884d57126a2f4579a0d75383ba5167ba/FLAG797ab9abf [2022-01-10 10:02:31,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3514e31a/884d57126a2f4579a0d75383ba5167ba [2022-01-10 10:02:31,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 10:02:31,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 10:02:31,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 10:02:31,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 10:02:31,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 10:02:31,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:31,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387bc19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31, skipping insertion in model container [2022-01-10 10:02:31,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:31,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 10:02:31,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 10:02:31,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c[35886,35899] [2022-01-10 10:02:31,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:02:31,939 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 10:02:31,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c[35886,35899] [2022-01-10 10:02:31,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:02:31,992 INFO L208 MainTranslator]: Completed translation [2022-01-10 10:02:31,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31 WrapperNode [2022-01-10 10:02:31,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 10:02:31,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 10:02:31,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 10:02:31,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 10:02:31,999 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:02:31" (1/1) ... [2022-01-10 10:02:32,014 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:02:31" (1/1) ... [2022-01-10 10:02:32,042 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 463 [2022-01-10 10:02:32,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 10:02:32,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 10:02:32,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 10:02:32,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 10:02:32,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:32,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:32,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:32,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:32,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:32,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:32,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:32,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 10:02:32,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 10:02:32,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 10:02:32,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 10:02:32,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31" (1/1) ... [2022-01-10 10:02:32,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:02:32,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:02:32,128 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:02:32,151 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:02:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 10:02:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 10:02:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 10:02:32,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 10:02:32,256 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 10:02:32,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 10:02:32,281 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 10:02:32,683 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-10 10:02:32,684 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-10 10:02:32,684 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 10:02:32,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 10:02:32,691 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 10:02:32,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:02:32 BoogieIcfgContainer [2022-01-10 10:02:32,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 10:02:32,694 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 10:02:32,694 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 10:02:32,695 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 10:02:32,698 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:02:32" (1/1) ... [2022-01-10 10:02:32,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:02:32 BasicIcfg [2022-01-10 10:02:32,858 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 10:02:32,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 10:02:32,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 10:02:32,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 10:02:32,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 10:02:31" (1/4) ... [2022-01-10 10:02:32,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb1aa1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:02:32, skipping insertion in model container [2022-01-10 10:02:32,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:02:31" (2/4) ... [2022-01-10 10:02:32,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb1aa1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:02:32, skipping insertion in model container [2022-01-10 10:02:32,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:02:32" (3/4) ... [2022-01-10 10:02:32,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb1aa1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:02:32, skipping insertion in model container [2022-01-10 10:02:32,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:02:32" (4/4) ... [2022-01-10 10:02:32,865 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.cTransformedIcfg [2022-01-10 10:02:32,869 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 10:02:32,869 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 10:02:32,909 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 10:02:32,916 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:02:32,916 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 10:02:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 10:02:32,945 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:32,946 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] [2022-01-10 10:02:32,946 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:32,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash 121089086, now seen corresponding path program 1 times [2022-01-10 10:02:32,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:32,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407578215] [2022-01-10 10:02:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:32,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:33,211 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:02:33,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:33,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407578215] [2022-01-10 10:02:33,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407578215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:33,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:33,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:33,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037621665] [2022-01-10 10:02:33,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:33,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:33,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:33,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:33,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:33,257 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:02:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:33,370 INFO L93 Difference]: Finished difference Result 366 states and 620 transitions. [2022-01-10 10:02:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 10:02:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:33,390 INFO L225 Difference]: With dead ends: 366 [2022-01-10 10:02:33,390 INFO L226 Difference]: Without dead ends: 213 [2022-01-10 10:02:33,394 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:02:33,398 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 179 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:33,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 398 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-01-10 10:02:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-01-10 10:02:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4952830188679245) internal successors, (317), 212 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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:02:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-01-10 10:02:33,477 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2022-01-10 10:02:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:33,478 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-01-10 10:02:33,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:02:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-01-10 10:02:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 10:02:33,481 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:33,481 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 10:02:33,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 10:02:33,482 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2040544070, now seen corresponding path program 1 times [2022-01-10 10:02:33,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:33,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494728402] [2022-01-10 10:02:33,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:33,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:02:33,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:33,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494728402] [2022-01-10 10:02:33,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494728402] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:33,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:33,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:33,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180441460] [2022-01-10 10:02:33,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:33,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:33,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:33,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:33,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:33,619 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:02:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:33,811 INFO L93 Difference]: Finished difference Result 343 states and 516 transitions. [2022-01-10 10:02:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:33,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-01-10 10:02:33,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:33,813 INFO L225 Difference]: With dead ends: 343 [2022-01-10 10:02:33,814 INFO L226 Difference]: Without dead ends: 238 [2022-01-10 10:02:33,814 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:02:33,815 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:33,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 260 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 10:02:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-01-10 10:02:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2022-01-10 10:02:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.480349344978166) internal successors, (339), 229 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:02:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 339 transitions. [2022-01-10 10:02:33,827 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 339 transitions. Word has length 38 [2022-01-10 10:02:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:33,827 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 339 transitions. [2022-01-10 10:02:33,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:02:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 339 transitions. [2022-01-10 10:02:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 10:02:33,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:33,829 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:33,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 10:02:33,830 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:33,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash -948329018, now seen corresponding path program 1 times [2022-01-10 10:02:33,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:33,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224051355] [2022-01-10 10:02:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:33,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:02:33,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:33,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224051355] [2022-01-10 10:02:33,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224051355] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:33,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:33,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:33,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639980674] [2022-01-10 10:02:33,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:33,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:33,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:33,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:33,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:33,908 INFO L87 Difference]: Start difference. First operand 230 states and 339 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:02:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:33,931 INFO L93 Difference]: Finished difference Result 373 states and 547 transitions. [2022-01-10 10:02:33,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:33,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-01-10 10:02:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:33,933 INFO L225 Difference]: With dead ends: 373 [2022-01-10 10:02:33,933 INFO L226 Difference]: Without dead ends: 251 [2022-01-10 10:02:33,937 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:02:33,940 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:33,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 347 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-01-10 10:02:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-01-10 10:02:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.464) internal successors, (366), 250 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:02:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 366 transitions. [2022-01-10 10:02:33,962 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 366 transitions. Word has length 55 [2022-01-10 10:02:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:33,963 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 366 transitions. [2022-01-10 10:02:33,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:02:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 366 transitions. [2022-01-10 10:02:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 10:02:33,964 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:33,964 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:02:33,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 10:02:33,965 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:33,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1128880325, now seen corresponding path program 1 times [2022-01-10 10:02:33,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:33,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420595040] [2022-01-10 10:02:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:33,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 10:02:34,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:34,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420595040] [2022-01-10 10:02:34,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420595040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:34,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:34,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:34,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349572749] [2022-01-10 10:02:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:34,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:34,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:34,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:34,049 INFO L87 Difference]: Start difference. First operand 251 states and 366 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:02:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:34,211 INFO L93 Difference]: Finished difference Result 597 states and 899 transitions. [2022-01-10 10:02:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:34,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 55 [2022-01-10 10:02:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:34,213 INFO L225 Difference]: With dead ends: 597 [2022-01-10 10:02:34,214 INFO L226 Difference]: Without dead ends: 351 [2022-01-10 10:02:34,214 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:02:34,215 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 53 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:34,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 224 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-01-10 10:02:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 333. [2022-01-10 10:02:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.4036144578313252) internal successors, (466), 332 states have internal predecessors, (466), 0 states have call successors, (0), 0 states 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:02:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 466 transitions. [2022-01-10 10:02:34,228 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 466 transitions. Word has length 55 [2022-01-10 10:02:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:34,230 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 466 transitions. [2022-01-10 10:02:34,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:02:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2022-01-10 10:02:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 10:02:34,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:34,236 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2022-01-10 10:02:34,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 10:02:34,237 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:34,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1875579760, now seen corresponding path program 1 times [2022-01-10 10:02:34,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:34,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504579919] [2022-01-10 10:02:34,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:34,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 10:02:34,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:34,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504579919] [2022-01-10 10:02:34,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504579919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:34,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:34,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:34,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214892154] [2022-01-10 10:02:34,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:34,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:34,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:34,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:34,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:34,357 INFO L87 Difference]: Start difference. First operand 333 states and 466 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:02:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:34,466 INFO L93 Difference]: Finished difference Result 709 states and 1005 transitions. [2022-01-10 10:02:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:34,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 68 [2022-01-10 10:02:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:34,468 INFO L225 Difference]: With dead ends: 709 [2022-01-10 10:02:34,468 INFO L226 Difference]: Without dead ends: 383 [2022-01-10 10:02:34,469 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:02:34,473 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:34,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 263 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-01-10 10:02:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 371. [2022-01-10 10:02:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.3891891891891892) internal successors, (514), 370 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:02:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 514 transitions. [2022-01-10 10:02:34,492 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 514 transitions. Word has length 68 [2022-01-10 10:02:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:34,495 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 514 transitions. [2022-01-10 10:02:34,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:02:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 514 transitions. [2022-01-10 10:02:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 10:02:34,498 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:34,498 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2022-01-10 10:02:34,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 10:02:34,498 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash 132872067, now seen corresponding path program 1 times [2022-01-10 10:02:34,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:34,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762804393] [2022-01-10 10:02:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:34,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 10:02:34,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:34,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762804393] [2022-01-10 10:02:34,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762804393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:34,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:34,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:34,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768469280] [2022-01-10 10:02:34,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:34,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:34,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:34,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:34,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:34,614 INFO L87 Difference]: Start difference. First operand 371 states and 514 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:02:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:34,755 INFO L93 Difference]: Finished difference Result 874 states and 1238 transitions. [2022-01-10 10:02:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:34,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 81 [2022-01-10 10:02:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:34,761 INFO L225 Difference]: With dead ends: 874 [2022-01-10 10:02:34,761 INFO L226 Difference]: Without dead ends: 508 [2022-01-10 10:02:34,762 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:02:34,764 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 127 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:34,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 173 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-01-10 10:02:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 482. [2022-01-10 10:02:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.4241164241164241) internal successors, (685), 481 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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:02:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 685 transitions. [2022-01-10 10:02:34,781 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 685 transitions. Word has length 81 [2022-01-10 10:02:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:34,781 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 685 transitions. [2022-01-10 10:02:34,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:02:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 685 transitions. [2022-01-10 10:02:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 10:02:34,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:34,783 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 10:02:34,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 10:02:34,783 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:34,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1707664560, now seen corresponding path program 1 times [2022-01-10 10:02:34,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:34,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119342955] [2022-01-10 10:02:34,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:34,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 10:02:34,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:34,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119342955] [2022-01-10 10:02:34,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119342955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:34,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:34,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:34,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829864104] [2022-01-10 10:02:34,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:34,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:34,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:34,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:34,860 INFO L87 Difference]: Start difference. First operand 482 states and 685 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:02:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:34,978 INFO L93 Difference]: Finished difference Result 972 states and 1399 transitions. [2022-01-10 10:02:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:34,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 85 [2022-01-10 10:02:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:34,981 INFO L225 Difference]: With dead ends: 972 [2022-01-10 10:02:34,981 INFO L226 Difference]: Without dead ends: 530 [2022-01-10 10:02:34,982 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:02:34,982 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:34,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 262 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-01-10 10:02:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 524. [2022-01-10 10:02:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.4091778202676863) internal successors, (737), 523 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:02:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 737 transitions. [2022-01-10 10:02:34,994 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 737 transitions. Word has length 85 [2022-01-10 10:02:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:34,995 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 737 transitions. [2022-01-10 10:02:34,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:02:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 737 transitions. [2022-01-10 10:02:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 10:02:34,996 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:34,996 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-01-10 10:02:34,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 10:02:34,997 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1856000275, now seen corresponding path program 1 times [2022-01-10 10:02:34,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:34,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138592996] [2022-01-10 10:02:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:34,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 10:02:35,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:35,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138592996] [2022-01-10 10:02:35,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138592996] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:35,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:35,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:35,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619425551] [2022-01-10 10:02:35,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:35,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:35,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:35,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:35,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:35,055 INFO L87 Difference]: Start difference. First operand 524 states and 737 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:02:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:35,086 INFO L93 Difference]: Finished difference Result 1027 states and 1457 transitions. [2022-01-10 10:02:35,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:35,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-10 10:02:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:35,090 INFO L225 Difference]: With dead ends: 1027 [2022-01-10 10:02:35,090 INFO L226 Difference]: Without dead ends: 764 [2022-01-10 10:02:35,091 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:02:35,091 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 136 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:35,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 307 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-01-10 10:02:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2022-01-10 10:02:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 1.4154652686762779) internal successors, (1080), 763 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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:02:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1080 transitions. [2022-01-10 10:02:35,110 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1080 transitions. Word has length 105 [2022-01-10 10:02:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:35,110 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 1080 transitions. [2022-01-10 10:02:35,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:02:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1080 transitions. [2022-01-10 10:02:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 10:02:35,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:35,112 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-01-10 10:02:35,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 10:02:35,112 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash -611049476, now seen corresponding path program 1 times [2022-01-10 10:02:35,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:35,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624893815] [2022-01-10 10:02:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:35,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 10:02:35,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:35,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624893815] [2022-01-10 10:02:35,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624893815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:35,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:35,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:35,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498061422] [2022-01-10 10:02:35,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:35,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:35,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:35,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:35,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:35,178 INFO L87 Difference]: Start difference. First operand 764 states and 1080 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:02:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:35,210 INFO L93 Difference]: Finished difference Result 1006 states and 1427 transitions. [2022-01-10 10:02:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:35,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-10 10:02:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:35,215 INFO L225 Difference]: With dead ends: 1006 [2022-01-10 10:02:35,215 INFO L226 Difference]: Without dead ends: 1004 [2022-01-10 10:02:35,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:02:35,217 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 139 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:35,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 305 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-01-10 10:02:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2022-01-10 10:02:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 1.4207377866400797) internal successors, (1425), 1003 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states 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:02:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1425 transitions. [2022-01-10 10:02:35,239 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1425 transitions. Word has length 107 [2022-01-10 10:02:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:35,240 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 1425 transitions. [2022-01-10 10:02:35,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:02:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1425 transitions. [2022-01-10 10:02:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-01-10 10:02:35,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:35,248 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 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] [2022-01-10 10:02:35,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 10:02:35,248 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1971659824, now seen corresponding path program 1 times [2022-01-10 10:02:35,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:35,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242858280] [2022-01-10 10:02:35,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:35,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-10 10:02:35,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:35,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242858280] [2022-01-10 10:02:35,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242858280] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:35,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:35,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:35,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671351307] [2022-01-10 10:02:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:35,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:35,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:35,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:35,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:35,311 INFO L87 Difference]: Start difference. First operand 1004 states and 1425 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:02:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:35,478 INFO L93 Difference]: Finished difference Result 2172 states and 3142 transitions. [2022-01-10 10:02:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:35,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 147 [2022-01-10 10:02:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:35,482 INFO L225 Difference]: With dead ends: 2172 [2022-01-10 10:02:35,483 INFO L226 Difference]: Without dead ends: 1200 [2022-01-10 10:02:35,484 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:02:35,485 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 77 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:35,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 206 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-01-10 10:02:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1160. [2022-01-10 10:02:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 1.436583261432269) internal successors, (1665), 1159 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states 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:02:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1665 transitions. [2022-01-10 10:02:35,539 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1665 transitions. Word has length 147 [2022-01-10 10:02:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:35,540 INFO L470 AbstractCegarLoop]: Abstraction has 1160 states and 1665 transitions. [2022-01-10 10:02:35,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:02:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1665 transitions. [2022-01-10 10:02:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-10 10:02:35,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:35,543 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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] [2022-01-10 10:02:35,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 10:02:35,543 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:35,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash -53968115, now seen corresponding path program 1 times [2022-01-10 10:02:35,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:35,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141092302] [2022-01-10 10:02:35,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:35,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-10 10:02:35,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141092302] [2022-01-10 10:02:35,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141092302] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:35,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:35,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:35,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743549353] [2022-01-10 10:02:35,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:35,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:35,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:35,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:35,625 INFO L87 Difference]: Start difference. First operand 1160 states and 1665 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:02:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:35,744 INFO L93 Difference]: Finished difference Result 2386 states and 3412 transitions. [2022-01-10 10:02:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:35,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 183 [2022-01-10 10:02:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:35,749 INFO L225 Difference]: With dead ends: 2386 [2022-01-10 10:02:35,749 INFO L226 Difference]: Without dead ends: 1266 [2022-01-10 10:02:35,751 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:02:35,751 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:35,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-01-10 10:02:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1252. [2022-01-10 10:02:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.4204636290967225) internal successors, (1777), 1251 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states 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:02:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1777 transitions. [2022-01-10 10:02:35,778 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1777 transitions. Word has length 183 [2022-01-10 10:02:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:35,778 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 1777 transitions. [2022-01-10 10:02:35,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:02:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1777 transitions. [2022-01-10 10:02:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-01-10 10:02:35,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:35,781 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 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] [2022-01-10 10:02:35,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 10:02:35,782 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash 110712680, now seen corresponding path program 1 times [2022-01-10 10:02:35,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:35,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199108699] [2022-01-10 10:02:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:35,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-01-10 10:02:35,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:35,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199108699] [2022-01-10 10:02:35,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199108699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:35,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:35,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:35,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854010491] [2022-01-10 10:02:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:35,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:35,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:35,856 INFO L87 Difference]: Start difference. First operand 1252 states and 1777 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:02:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:35,978 INFO L93 Difference]: Finished difference Result 2576 states and 3654 transitions. [2022-01-10 10:02:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:35,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2022-01-10 10:02:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:35,983 INFO L225 Difference]: With dead ends: 2576 [2022-01-10 10:02:35,984 INFO L226 Difference]: Without dead ends: 1364 [2022-01-10 10:02:35,987 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:02:35,988 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:35,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 262 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-01-10 10:02:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2022-01-10 10:02:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1351 states have (on average 1.4041450777202074) internal successors, (1897), 1351 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states 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:02:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1897 transitions. [2022-01-10 10:02:36,015 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1897 transitions. Word has length 204 [2022-01-10 10:02:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:36,015 INFO L470 AbstractCegarLoop]: Abstraction has 1352 states and 1897 transitions. [2022-01-10 10:02:36,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:02:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1897 transitions. [2022-01-10 10:02:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-01-10 10:02:36,019 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:36,019 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2022-01-10 10:02:36,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 10:02:36,019 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:36,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash -182429664, now seen corresponding path program 1 times [2022-01-10 10:02:36,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:36,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101430604] [2022-01-10 10:02:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:36,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-01-10 10:02:36,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:36,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101430604] [2022-01-10 10:02:36,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101430604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:36,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:36,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:36,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201681446] [2022-01-10 10:02:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:36,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:36,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:36,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:36,105 INFO L87 Difference]: Start difference. First operand 1352 states and 1897 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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:02:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:36,224 INFO L93 Difference]: Finished difference Result 2784 states and 3906 transitions. [2022-01-10 10:02:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:36,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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 228 [2022-01-10 10:02:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:36,229 INFO L225 Difference]: With dead ends: 2784 [2022-01-10 10:02:36,229 INFO L226 Difference]: Without dead ends: 1472 [2022-01-10 10:02:36,231 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:02:36,231 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:36,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-01-10 10:02:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1464. [2022-01-10 10:02:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.3868762816131237) internal successors, (2029), 1463 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states 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:02:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2029 transitions. [2022-01-10 10:02:36,281 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2029 transitions. Word has length 228 [2022-01-10 10:02:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:36,281 INFO L470 AbstractCegarLoop]: Abstraction has 1464 states and 2029 transitions. [2022-01-10 10:02:36,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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:02:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2029 transitions. [2022-01-10 10:02:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-01-10 10:02:36,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:36,286 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2022-01-10 10:02:36,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 10:02:36,286 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:36,286 INFO L85 PathProgramCache]: Analyzing trace with hash 333090785, now seen corresponding path program 1 times [2022-01-10 10:02:36,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:36,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927732938] [2022-01-10 10:02:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:36,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-01-10 10:02:36,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:36,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927732938] [2022-01-10 10:02:36,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927732938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:36,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:36,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:36,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700047906] [2022-01-10 10:02:36,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:36,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:36,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:36,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:36,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:36,358 INFO L87 Difference]: Start difference. First operand 1464 states and 2029 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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:02:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:36,476 INFO L93 Difference]: Finished difference Result 3024 states and 4206 transitions. [2022-01-10 10:02:36,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:36,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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 228 [2022-01-10 10:02:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:36,481 INFO L225 Difference]: With dead ends: 3024 [2022-01-10 10:02:36,481 INFO L226 Difference]: Without dead ends: 1600 [2022-01-10 10:02:36,483 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:02:36,484 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:36,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 263 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-01-10 10:02:36,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1588. [2022-01-10 10:02:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1587 states have (on average 1.3692501575299307) internal successors, (2173), 1587 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states 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:02:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2173 transitions. [2022-01-10 10:02:36,513 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2173 transitions. Word has length 228 [2022-01-10 10:02:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:36,513 INFO L470 AbstractCegarLoop]: Abstraction has 1588 states and 2173 transitions. [2022-01-10 10:02:36,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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:02:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2173 transitions. [2022-01-10 10:02:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-01-10 10:02:36,517 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:36,517 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2022-01-10 10:02:36,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 10:02:36,517 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1678416466, now seen corresponding path program 1 times [2022-01-10 10:02:36,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:36,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112572138] [2022-01-10 10:02:36,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:36,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-01-10 10:02:36,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:36,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112572138] [2022-01-10 10:02:36,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112572138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:36,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:36,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:36,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209895834] [2022-01-10 10:02:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:36,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:36,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:36,591 INFO L87 Difference]: Start difference. First operand 1588 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:02:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:36,633 INFO L93 Difference]: Finished difference Result 4568 states and 6287 transitions. [2022-01-10 10:02:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:36,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 258 [2022-01-10 10:02:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:36,643 INFO L225 Difference]: With dead ends: 4568 [2022-01-10 10:02:36,643 INFO L226 Difference]: Without dead ends: 3020 [2022-01-10 10:02:36,646 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:02:36,646 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:36,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 484 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2022-01-10 10:02:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 3018. [2022-01-10 10:02:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 3017 states have (on average 1.3765329797812396) internal successors, (4153), 3017 states have internal predecessors, (4153), 0 states have call successors, (0), 0 states 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:02:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4153 transitions. [2022-01-10 10:02:36,708 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4153 transitions. Word has length 258 [2022-01-10 10:02:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:36,709 INFO L470 AbstractCegarLoop]: Abstraction has 3018 states and 4153 transitions. [2022-01-10 10:02:36,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:02:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4153 transitions. [2022-01-10 10:02:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-01-10 10:02:36,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:36,715 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2022-01-10 10:02:36,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 10:02:36,715 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:36,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:36,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1162896017, now seen corresponding path program 1 times [2022-01-10 10:02:36,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:36,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342248375] [2022-01-10 10:02:36,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:36,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-01-10 10:02:36,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:36,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342248375] [2022-01-10 10:02:36,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342248375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:36,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:36,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:36,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135969295] [2022-01-10 10:02:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:36,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:36,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:36,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:36,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:36,836 INFO L87 Difference]: Start difference. First operand 3018 states and 4153 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:02:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:36,997 INFO L93 Difference]: Finished difference Result 6296 states and 8702 transitions. [2022-01-10 10:02:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:36,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 258 [2022-01-10 10:02:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:37,008 INFO L225 Difference]: With dead ends: 6296 [2022-01-10 10:02:37,008 INFO L226 Difference]: Without dead ends: 3318 [2022-01-10 10:02:37,013 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:02:37,014 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:37,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 263 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2022-01-10 10:02:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 3302. [2022-01-10 10:02:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 3301 states have (on average 1.3562556800969403) internal successors, (4477), 3301 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states 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:02:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4477 transitions. [2022-01-10 10:02:37,104 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4477 transitions. Word has length 258 [2022-01-10 10:02:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:37,105 INFO L470 AbstractCegarLoop]: Abstraction has 3302 states and 4477 transitions. [2022-01-10 10:02:37,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:02:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4477 transitions. [2022-01-10 10:02:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-01-10 10:02:37,113 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:37,113 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2022-01-10 10:02:37,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 10:02:37,114 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash -251776987, now seen corresponding path program 1 times [2022-01-10 10:02:37,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:37,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793650206] [2022-01-10 10:02:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:37,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2022-01-10 10:02:37,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:37,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793650206] [2022-01-10 10:02:37,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793650206] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:37,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:37,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:37,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415378780] [2022-01-10 10:02:37,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:37,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:37,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:37,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:37,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:37,203 INFO L87 Difference]: Start difference. First operand 3302 states and 4477 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:02:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:37,362 INFO L93 Difference]: Finished difference Result 6712 states and 9118 transitions. [2022-01-10 10:02:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:37,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 282 [2022-01-10 10:02:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:37,374 INFO L225 Difference]: With dead ends: 6712 [2022-01-10 10:02:37,374 INFO L226 Difference]: Without dead ends: 3450 [2022-01-10 10:02:37,378 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:02:37,379 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:37,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2022-01-10 10:02:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3434. [2022-01-10 10:02:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 3433 states have (on average 1.3483833381881736) internal successors, (4629), 3433 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states 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:02:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4629 transitions. [2022-01-10 10:02:37,457 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4629 transitions. Word has length 282 [2022-01-10 10:02:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:37,457 INFO L470 AbstractCegarLoop]: Abstraction has 3434 states and 4629 transitions. [2022-01-10 10:02:37,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:02:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4629 transitions. [2022-01-10 10:02:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-01-10 10:02:37,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:37,464 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 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] [2022-01-10 10:02:37,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 10:02:37,465 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:37,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1845991766, now seen corresponding path program 1 times [2022-01-10 10:02:37,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:37,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560164899] [2022-01-10 10:02:37,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:37,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-01-10 10:02:37,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:37,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560164899] [2022-01-10 10:02:37,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560164899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:37,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:37,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:37,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941333276] [2022-01-10 10:02:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:37,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:37,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:37,564 INFO L87 Difference]: Start difference. First operand 3434 states and 4629 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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:02:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:37,752 INFO L93 Difference]: Finished difference Result 7228 states and 9882 transitions. [2022-01-10 10:02:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:37,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 293 [2022-01-10 10:02:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:37,764 INFO L225 Difference]: With dead ends: 7228 [2022-01-10 10:02:37,764 INFO L226 Difference]: Without dead ends: 3834 [2022-01-10 10:02:37,768 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:02:37,768 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 48 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:37,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 255 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2022-01-10 10:02:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3746. [2022-01-10 10:02:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3746 states, 3745 states have (on average 1.3343124165554072) internal successors, (4997), 3745 states have internal predecessors, (4997), 0 states have call successors, (0), 0 states 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:02:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 4997 transitions. [2022-01-10 10:02:37,849 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 4997 transitions. Word has length 293 [2022-01-10 10:02:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:37,850 INFO L470 AbstractCegarLoop]: Abstraction has 3746 states and 4997 transitions. [2022-01-10 10:02:37,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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:02:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 4997 transitions. [2022-01-10 10:02:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-01-10 10:02:37,857 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:37,857 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 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, 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] [2022-01-10 10:02:37,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 10:02:37,857 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:37,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1975193173, now seen corresponding path program 1 times [2022-01-10 10:02:37,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:37,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826257829] [2022-01-10 10:02:37,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:37,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 10:02:37,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:37,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826257829] [2022-01-10 10:02:37,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826257829] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:37,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:37,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:37,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886599686] [2022-01-10 10:02:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:37,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:37,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:37,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:37,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:37,941 INFO L87 Difference]: Start difference. First operand 3746 states and 4997 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:02:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:38,131 INFO L93 Difference]: Finished difference Result 7860 states and 10426 transitions. [2022-01-10 10:02:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:38,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 307 [2022-01-10 10:02:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:38,145 INFO L225 Difference]: With dead ends: 7860 [2022-01-10 10:02:38,145 INFO L226 Difference]: Without dead ends: 4154 [2022-01-10 10:02:38,150 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:02:38,150 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 136 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:38,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 140 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2022-01-10 10:02:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 3866. [2022-01-10 10:02:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3865 states have (on average 1.3301423027166883) internal successors, (5141), 3865 states have internal predecessors, (5141), 0 states have call successors, (0), 0 states 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:02:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 5141 transitions. [2022-01-10 10:02:38,235 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 5141 transitions. Word has length 307 [2022-01-10 10:02:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:38,235 INFO L470 AbstractCegarLoop]: Abstraction has 3866 states and 5141 transitions. [2022-01-10 10:02:38,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:02:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 5141 transitions. [2022-01-10 10:02:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-01-10 10:02:38,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:38,244 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 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, 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] [2022-01-10 10:02:38,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 10:02:38,244 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1616577104, now seen corresponding path program 1 times [2022-01-10 10:02:38,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:38,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396487830] [2022-01-10 10:02:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:38,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2022-01-10 10:02:38,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:38,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396487830] [2022-01-10 10:02:38,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396487830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:38,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:38,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:38,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134542835] [2022-01-10 10:02:38,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:38,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:38,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:38,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:38,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:38,361 INFO L87 Difference]: Start difference. First operand 3866 states and 5141 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:02:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:38,457 INFO L93 Difference]: Finished difference Result 11014 states and 14735 transitions. [2022-01-10 10:02:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:38,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 308 [2022-01-10 10:02:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:38,474 INFO L225 Difference]: With dead ends: 11014 [2022-01-10 10:02:38,474 INFO L226 Difference]: Without dead ends: 7188 [2022-01-10 10:02:38,481 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:02:38,482 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 84 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:38,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 472 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:02:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7188 states. [2022-01-10 10:02:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7188 to 7186. [2022-01-10 10:02:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7186 states, 7185 states have (on average 1.3384829505915101) internal successors, (9617), 7185 states have internal predecessors, (9617), 0 states have call successors, (0), 0 states 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:02:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7186 states to 7186 states and 9617 transitions. [2022-01-10 10:02:38,640 INFO L78 Accepts]: Start accepts. Automaton has 7186 states and 9617 transitions. Word has length 308 [2022-01-10 10:02:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:38,641 INFO L470 AbstractCegarLoop]: Abstraction has 7186 states and 9617 transitions. [2022-01-10 10:02:38,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:02:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7186 states and 9617 transitions. [2022-01-10 10:02:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-01-10 10:02:38,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:38,652 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 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, 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] [2022-01-10 10:02:38,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 10:02:38,653 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1095932070, now seen corresponding path program 1 times [2022-01-10 10:02:38,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:38,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682522167] [2022-01-10 10:02:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:38,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2022-01-10 10:02:38,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:38,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682522167] [2022-01-10 10:02:38,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682522167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:38,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:38,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:38,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723280794] [2022-01-10 10:02:38,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:38,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:38,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:38,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:38,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:38,740 INFO L87 Difference]: Start difference. First operand 7186 states and 9617 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:38,993 INFO L93 Difference]: Finished difference Result 14340 states and 19178 transitions. [2022-01-10 10:02:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 309 [2022-01-10 10:02:38,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:39,008 INFO L225 Difference]: With dead ends: 14340 [2022-01-10 10:02:39,008 INFO L226 Difference]: Without dead ends: 7194 [2022-01-10 10:02:39,018 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:02:39,019 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:39,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 258 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 10:02:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2022-01-10 10:02:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 7162. [2022-01-10 10:02:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7162 states, 7161 states have (on average 1.3038681748359169) internal successors, (9337), 7161 states have internal predecessors, (9337), 0 states have call successors, (0), 0 states 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:02:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7162 states to 7162 states and 9337 transitions. [2022-01-10 10:02:39,183 INFO L78 Accepts]: Start accepts. Automaton has 7162 states and 9337 transitions. Word has length 309 [2022-01-10 10:02:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:39,184 INFO L470 AbstractCegarLoop]: Abstraction has 7162 states and 9337 transitions. [2022-01-10 10:02:39,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 7162 states and 9337 transitions. [2022-01-10 10:02:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2022-01-10 10:02:39,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:39,195 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-01-10 10:02:39,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 10:02:39,195 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:39,196 INFO L85 PathProgramCache]: Analyzing trace with hash 908102695, now seen corresponding path program 1 times [2022-01-10 10:02:39,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:39,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570422028] [2022-01-10 10:02:39,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:39,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-01-10 10:02:39,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570422028] [2022-01-10 10:02:39,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570422028] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 10:02:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986367402] [2022-01-10 10:02:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:39,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:02:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:02:39,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 10:02:39,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 10:02:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:39,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 10:02:39,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 10:02:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-01-10 10:02:40,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 10:02:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-01-10 10:02:40,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986367402] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 10:02:40,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 10:02:40,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 10:02:40,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402906968] [2022-01-10 10:02:40,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 10:02:40,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 10:02:40,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 10:02:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 10:02:40,670 INFO L87 Difference]: Start difference. First operand 7162 states and 9337 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:02:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:41,206 INFO L93 Difference]: Finished difference Result 14358 states and 18729 transitions. [2022-01-10 10:02:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 10:02:41,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 332 [2022-01-10 10:02:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:41,228 INFO L225 Difference]: With dead ends: 14358 [2022-01-10 10:02:41,229 INFO L226 Difference]: Without dead ends: 10876 [2022-01-10 10:02:41,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-10 10:02:41,239 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 347 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:41,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 760 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 10:02:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10876 states. [2022-01-10 10:02:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10876 to 8266. [2022-01-10 10:02:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8266 states, 8265 states have (on average 1.3107078039927405) internal successors, (10833), 8265 states have internal predecessors, (10833), 0 states have call successors, (0), 0 states 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:02:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 10833 transitions. [2022-01-10 10:02:41,476 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 10833 transitions. Word has length 332 [2022-01-10 10:02:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:41,477 INFO L470 AbstractCegarLoop]: Abstraction has 8266 states and 10833 transitions. [2022-01-10 10:02:41,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:02:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 10833 transitions. [2022-01-10 10:02:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2022-01-10 10:02:41,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:41,492 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 10:02:41,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-10 10:02:41,712 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:41,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:41,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1539510381, now seen corresponding path program 2 times [2022-01-10 10:02:41,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:41,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093831148] [2022-01-10 10:02:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:41,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-01-10 10:02:41,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:41,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093831148] [2022-01-10 10:02:41,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093831148] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 10:02:41,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548914217] [2022-01-10 10:02:41,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 10:02:41,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:02:41,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:02:41,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 10:02:41,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 10:02:42,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 10:02:42,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 10:02:42,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 10:02:42,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 10:02:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2022-01-10 10:02:42,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 10:02:42,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548914217] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:42,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 10:02:42,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 10:02:42,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097497386] [2022-01-10 10:02:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:42,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:42,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:42,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 10:02:42,637 INFO L87 Difference]: Start difference. First operand 8266 states and 10833 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:02:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:42,879 INFO L93 Difference]: Finished difference Result 16772 states and 21958 transitions. [2022-01-10 10:02:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:42,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 345 [2022-01-10 10:02:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:42,895 INFO L225 Difference]: With dead ends: 16772 [2022-01-10 10:02:42,896 INFO L226 Difference]: Without dead ends: 8546 [2022-01-10 10:02:42,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 10:02:42,908 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:42,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 238 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8546 states. [2022-01-10 10:02:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8546 to 7690. [2022-01-10 10:02:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7690 states, 7689 states have (on average 1.259071400702302) internal successors, (9681), 7689 states have internal predecessors, (9681), 0 states have call successors, (0), 0 states 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:02:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7690 states to 7690 states and 9681 transitions. [2022-01-10 10:02:43,144 INFO L78 Accepts]: Start accepts. Automaton has 7690 states and 9681 transitions. Word has length 345 [2022-01-10 10:02:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:43,145 INFO L470 AbstractCegarLoop]: Abstraction has 7690 states and 9681 transitions. [2022-01-10 10:02:43,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:02:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7690 states and 9681 transitions. [2022-01-10 10:02:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-01-10 10:02:43,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:43,157 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:43,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 10:02:43,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-10 10:02:43,371 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:43,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1874486523, now seen corresponding path program 1 times [2022-01-10 10:02:43,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:43,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725785929] [2022-01-10 10:02:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:43,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 10:02:43,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:43,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725785929] [2022-01-10 10:02:43,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725785929] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 10:02:43,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797136033] [2022-01-10 10:02:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:43,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:02:43,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:02:43,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 10:02:43,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 10:02:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:43,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 1555 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 10:02:43,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 10:02:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 10:02:44,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 10:02:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 10:02:44,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797136033] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 10:02:44,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 10:02:44,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 10:02:44,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653227492] [2022-01-10 10:02:44,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 10:02:44,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 10:02:44,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 10:02:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 10:02:44,678 INFO L87 Difference]: Start difference. First operand 7690 states and 9681 transitions. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:02:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:45,033 INFO L93 Difference]: Finished difference Result 17491 states and 21920 transitions. [2022-01-10 10:02:45,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 10:02:45,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 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 376 [2022-01-10 10:02:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:45,051 INFO L225 Difference]: With dead ends: 17491 [2022-01-10 10:02:45,051 INFO L226 Difference]: Without dead ends: 9833 [2022-01-10 10:02:45,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 751 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 10:02:45,065 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 220 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:45,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 608 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 10:02:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9833 states. [2022-01-10 10:02:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9833 to 8080. [2022-01-10 10:02:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8080 states, 8079 states have (on average 1.255600940710484) internal successors, (10144), 8079 states have internal predecessors, (10144), 0 states have call successors, (0), 0 states 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:02:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8080 states to 8080 states and 10144 transitions. [2022-01-10 10:02:45,237 INFO L78 Accepts]: Start accepts. Automaton has 8080 states and 10144 transitions. Word has length 376 [2022-01-10 10:02:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:45,238 INFO L470 AbstractCegarLoop]: Abstraction has 8080 states and 10144 transitions. [2022-01-10 10:02:45,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:02:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8080 states and 10144 transitions. [2022-01-10 10:02:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2022-01-10 10:02:45,252 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:45,252 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:45,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 10:02:45,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:02:45,478 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:45,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:45,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1575394670, now seen corresponding path program 1 times [2022-01-10 10:02:45,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:45,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237776521] [2022-01-10 10:02:45,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:45,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-01-10 10:02:45,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:45,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237776521] [2022-01-10 10:02:45,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237776521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:02:45,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:02:45,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:02:45,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790687173] [2022-01-10 10:02:45,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:02:45,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:02:45,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:45,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:02:45,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:02:45,591 INFO L87 Difference]: Start difference. First operand 8080 states and 10144 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:02:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:45,818 INFO L93 Difference]: Finished difference Result 15226 states and 18739 transitions. [2022-01-10 10:02:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:02:45,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 415 [2022-01-10 10:02:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:45,826 INFO L225 Difference]: With dead ends: 15226 [2022-01-10 10:02:45,826 INFO L226 Difference]: Without dead ends: 3772 [2022-01-10 10:02:45,837 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:02:45,839 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:45,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 264 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 10:02:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2022-01-10 10:02:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 3557. [2022-01-10 10:02:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 3556 states have (on average 1.2438132733408325) internal successors, (4423), 3556 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states 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:02:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 4423 transitions. [2022-01-10 10:02:45,921 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 4423 transitions. Word has length 415 [2022-01-10 10:02:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:45,921 INFO L470 AbstractCegarLoop]: Abstraction has 3557 states and 4423 transitions. [2022-01-10 10:02:45,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:02:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 4423 transitions. [2022-01-10 10:02:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2022-01-10 10:02:45,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:02:45,934 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:45,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 10:02:45,934 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:02:45,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:02:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash -607622356, now seen corresponding path program 1 times [2022-01-10 10:02:45,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:02:45,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161458527] [2022-01-10 10:02:45,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:45,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:02:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-01-10 10:02:46,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:02:46,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161458527] [2022-01-10 10:02:46,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161458527] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 10:02:46,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494040057] [2022-01-10 10:02:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:02:46,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 10:02:46,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:02:46,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 10:02:46,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 10:02:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:02:46,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 1890 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 10:02:46,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 10:02:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-01-10 10:02:46,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 10:02:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-01-10 10:02:47,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494040057] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 10:02:47,697 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 10:02:47,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 10:02:47,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888708008] [2022-01-10 10:02:47,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 10:02:47,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 10:02:47,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:02:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 10:02:47,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 10:02:47,699 INFO L87 Difference]: Start difference. First operand 3557 states and 4423 transitions. Second operand has 7 states, 7 states have (on average 43.857142857142854) internal successors, (307), 7 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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:02:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:02:47,999 INFO L93 Difference]: Finished difference Result 4410 states and 5479 transitions. [2022-01-10 10:02:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 10:02:47,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.857142857142854) internal successors, (307), 7 states have internal predecessors, (307), 0 states have call successors, (0), 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 482 [2022-01-10 10:02:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:02:48,000 INFO L225 Difference]: With dead ends: 4410 [2022-01-10 10:02:48,000 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 10:02:48,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 10:02:48,002 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 101 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 10:02:48,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 778 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 10:02:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 10:02:48,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 10:02:48,003 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:02:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 10:02:48,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 482 [2022-01-10 10:02:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:02:48,004 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 10:02:48,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.857142857142854) internal successors, (307), 7 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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:02:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 10:02:48,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 10:02:48,006 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 10:02:48,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 10:02:48,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-10 10:02:48,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 10:02:52,511 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 102) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L99-2(lines 96 102) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L99(lines 99 101) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 108) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 107) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L110-1(lines 87 562) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L861 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L556(lines 556 558) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 531) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L858 garLoopResultBuilder]: For program point L556-2(lines 556 558) no Hoare annotation was computed. [2022-01-10 10:02:52,512 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 531) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 10:02:52,513 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 530) no Hoare annotation was computed. [2022-01-10 10:02:52,513 INFO L861 garLoopResultBuilder]: At program point L561(lines 22 563) the Hoare annotation is: true [2022-01-10 10:02:52,513 INFO L854 garLoopResultBuilder]: At program point L218(lines 116 530) the Hoare annotation is: (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) [2022-01-10 10:02:52,513 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 529) no Hoare annotation was computed. [2022-01-10 10:02:52,513 INFO L861 garLoopResultBuilder]: At program point L572(lines 564 574) the Hoare annotation is: true [2022-01-10 10:02:52,513 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 225) no Hoare annotation was computed. [2022-01-10 10:02:52,513 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 528) no Hoare annotation was computed. [2022-01-10 10:02:52,513 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 10:02:52,513 INFO L858 garLoopResultBuilder]: For program point L223-2(lines 223 225) no Hoare annotation was computed. [2022-01-10 10:02:52,513 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 527) no Hoare annotation was computed. [2022-01-10 10:02:52,513 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 231) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 526) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 245) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 525) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L236(lines 236 239) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L234-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 264) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 524) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L240(lines 240 243) no Hoare annotation was computed. [2022-01-10 10:02:52,514 INFO L858 garLoopResultBuilder]: For program point L250(lines 250 253) no Hoare annotation was computed. [2022-01-10 10:02:52,515 INFO L858 garLoopResultBuilder]: For program point L262-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 10:02:52,515 INFO L854 garLoopResultBuilder]: At program point L138(lines 134 524) the Hoare annotation is: (let ((.cse0 (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (.cse1 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 1)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1))) [2022-01-10 10:02:52,515 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 523) no Hoare annotation was computed. [2022-01-10 10:02:52,515 INFO L854 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse9 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (.cse11 (= 4496 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse5 (= 4448 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse6 (= 4528 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse12 (= 4512 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse14 (= 4480 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse8 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4)) (.cse15 (= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 3)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse3 .cse4 .cse6) (and .cse3 .cse7 .cse8 .cse4 .cse9) (and .cse10 (= 4416 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse3) (and .cse10 .cse3 (= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (and .cse3 .cse4 .cse11) (and .cse3 .cse0 .cse4 .cse1 .cse9) (and .cse12 .cse2) (and .cse10 .cse3 .cse11) (and (= 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 1)) (and .cse4 .cse13) (and .cse10 .cse3 .cse5) (and (= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse3 .cse2) (and .cse6 .cse2) (and .cse10 .cse14 .cse3) (and .cse3 .cse4 .cse12) (and .cse10 .cse3 .cse6) (and .cse15 .cse3 .cse4) (and .cse10 .cse3 .cse12) (and .cse14 .cse3 .cse4) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse7 .cse8 .cse2) (and .cse10 .cse15 .cse3) (and .cse3 .cse13 .cse2))) [2022-01-10 10:02:52,515 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-01-10 10:02:52,515 INFO L858 garLoopResultBuilder]: For program point L277(lines 277 279) no Hoare annotation was computed. [2022-01-10 10:02:52,515 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 522) no Hoare annotation was computed. [2022-01-10 10:02:52,515 INFO L858 garLoopResultBuilder]: For program point L533(lines 533 547) no Hoare annotation was computed. [2022-01-10 10:02:52,515 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 548) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L277-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L854 garLoopResultBuilder]: At program point L144(lines 140 522) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1))) [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 521) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L534(lines 534 539) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 287) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 308) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 520) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 538) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L534-2(lines 533 547) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L283-2(lines 283 287) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L294-2(lines 294 308) no Hoare annotation was computed. [2022-01-10 10:02:52,516 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 304) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 520) the Hoare annotation is: (let ((.cse0 (< 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse1) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse1))) [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 519) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L301-2(lines 296 308) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L301(lines 301 303) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 318) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 518) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L316-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 517) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L324(lines 324 327) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 334) no Hoare annotation was computed. [2022-01-10 10:02:52,517 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 516) no Hoare annotation was computed. [2022-01-10 10:02:52,518 INFO L854 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: false [2022-01-10 10:02:52,518 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 337) no Hoare annotation was computed. [2022-01-10 10:02:52,518 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 516) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 10:02:52,518 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 515) no Hoare annotation was computed. [2022-01-10 10:02:52,518 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) no Hoare annotation was computed. [2022-01-10 10:02:52,518 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 346) no Hoare annotation was computed. [2022-01-10 10:02:52,518 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 514) no Hoare annotation was computed. [2022-01-10 10:02:52,518 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-01-10 10:02:52,518 INFO L854 garLoopResultBuilder]: At program point L174(lines 164 514) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 10:02:52,518 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 513) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L347-2(lines 347 351) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 361) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 512) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 511) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 510) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L854 garLoopResultBuilder]: At program point L180(lines 176 510) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 509) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 370) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 508) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 377) no Hoare annotation was computed. [2022-01-10 10:02:52,519 INFO L854 garLoopResultBuilder]: At program point L186(lines 182 508) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse0 .cse1))) [2022-01-10 10:02:52,519 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 507) no Hoare annotation was computed. [2022-01-10 10:02:52,520 INFO L858 garLoopResultBuilder]: For program point L372-2(lines 372 377) no Hoare annotation was computed. [2022-01-10 10:02:52,520 INFO L858 garLoopResultBuilder]: For program point L383(lines 383 385) no Hoare annotation was computed. [2022-01-10 10:02:52,520 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 506) no Hoare annotation was computed. [2022-01-10 10:02:52,520 INFO L854 garLoopResultBuilder]: At program point L192(lines 188 506) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse2 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse2) (and .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse0 .cse1 .cse2))) [2022-01-10 10:02:52,520 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 505) no Hoare annotation was computed. [2022-01-10 10:02:52,520 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 395) no Hoare annotation was computed. [2022-01-10 10:02:52,520 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 504) no Hoare annotation was computed. [2022-01-10 10:02:52,520 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 403) no Hoare annotation was computed. [2022-01-10 10:02:52,520 INFO L854 garLoopResultBuilder]: At program point L198(lines 194 504) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse2 (<= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse2) (and .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse0 .cse1 .cse2))) [2022-01-10 10:02:52,520 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 503) no Hoare annotation was computed. [2022-01-10 10:02:52,520 INFO L858 garLoopResultBuilder]: For program point L399-2(lines 213 496) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 502) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L408(lines 408 411) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 437) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L854 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (< |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 12292) .cse1) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)))) [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 501) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L423-1(lines 423 437) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L443(lines 443 445) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 500) no Hoare annotation was computed. [2022-01-10 10:02:52,521 INFO L858 garLoopResultBuilder]: For program point L446(lines 446 450) no Hoare annotation was computed. [2022-01-10 10:02:52,522 INFO L854 garLoopResultBuilder]: At program point L207(lines 206 500) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse1 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse0 .cse1) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 10:02:52,522 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 499) no Hoare annotation was computed. [2022-01-10 10:02:52,522 INFO L858 garLoopResultBuilder]: For program point L446-2(lines 446 450) no Hoare annotation was computed. [2022-01-10 10:02:52,522 INFO L858 garLoopResultBuilder]: For program point L456(lines 456 467) no Hoare annotation was computed. [2022-01-10 10:02:52,522 INFO L861 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-01-10 10:02:52,522 INFO L861 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-01-10 10:02:52,522 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 464) no Hoare annotation was computed. [2022-01-10 10:02:52,522 INFO L858 garLoopResultBuilder]: For program point L456-2(lines 456 467) no Hoare annotation was computed. [2022-01-10 10:02:52,522 INFO L858 garLoopResultBuilder]: For program point L472-1(lines 472 474) no Hoare annotation was computed. [2022-01-10 10:02:52,522 INFO L858 garLoopResultBuilder]: For program point L478(lines 478 480) no Hoare annotation was computed. [2022-01-10 10:02:52,522 INFO L858 garLoopResultBuilder]: For program point L478-2(lines 478 480) no Hoare annotation was computed. [2022-01-10 10:02:52,522 INFO L858 garLoopResultBuilder]: For program point L484(lines 484 486) no Hoare annotation was computed. [2022-01-10 10:02:52,523 INFO L858 garLoopResultBuilder]: For program point L484-2(lines 484 486) no Hoare annotation was computed. [2022-01-10 10:02:52,523 INFO L858 garLoopResultBuilder]: For program point L489(lines 489 491) no Hoare annotation was computed. [2022-01-10 10:02:52,526 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2022-01-10 10:02:52,527 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 10:02:52,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:02:52 BasicIcfg [2022-01-10 10:02:52,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 10:02:52,581 INFO L158 Benchmark]: Toolchain (without parser) took 20891.73ms. Allocated memory was 180.4MB in the beginning and 640.7MB in the end (delta: 460.3MB). Free memory was 123.1MB in the beginning and 457.6MB in the end (delta: -334.5MB). Peak memory consumption was 382.8MB. Max. memory is 8.0GB. [2022-01-10 10:02:52,581 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 10:02:52,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.12ms. Allocated memory was 180.4MB in the beginning and 272.6MB in the end (delta: 92.3MB). Free memory was 122.9MB in the beginning and 239.6MB in the end (delta: -116.7MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-01-10 10:02:52,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.38ms. Allocated memory is still 272.6MB. Free memory was 239.6MB in the beginning and 236.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 10:02:52,582 INFO L158 Benchmark]: Boogie Preprocessor took 31.70ms. Allocated memory is still 272.6MB. Free memory was 236.9MB in the beginning and 234.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 10:02:52,582 INFO L158 Benchmark]: RCFGBuilder took 617.38ms. Allocated memory is still 272.6MB. Free memory was 234.8MB in the beginning and 208.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-01-10 10:02:52,582 INFO L158 Benchmark]: IcfgTransformer took 164.54ms. Allocated memory is still 272.6MB. Free memory was 208.6MB in the beginning and 195.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 10:02:52,583 INFO L158 Benchmark]: TraceAbstraction took 19720.32ms. Allocated memory was 272.6MB in the beginning and 640.7MB in the end (delta: 368.1MB). Free memory was 194.5MB in the beginning and 457.6MB in the end (delta: -263.1MB). Peak memory consumption was 362.4MB. Max. memory is 8.0GB. [2022-01-10 10:02:52,590 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.12ms. Allocated memory is still 180.4MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.12ms. Allocated memory was 180.4MB in the beginning and 272.6MB in the end (delta: 92.3MB). Free memory was 122.9MB in the beginning and 239.6MB in the end (delta: -116.7MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.38ms. Allocated memory is still 272.6MB. Free memory was 239.6MB in the beginning and 236.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.70ms. Allocated memory is still 272.6MB. Free memory was 236.9MB in the beginning and 234.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 617.38ms. Allocated memory is still 272.6MB. Free memory was 234.8MB in the beginning and 208.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * IcfgTransformer took 164.54ms. Allocated memory is still 272.6MB. Free memory was 208.6MB in the beginning and 195.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 19720.32ms. Allocated memory was 272.6MB in the beginning and 640.7MB in the end (delta: 368.1MB). Free memory was 194.5MB in the beginning and 457.6MB in the end (delta: -263.1MB). Peak memory consumption was 362.4MB. 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: 560]: 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, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 26, TraceHistogramMax: 18, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2000 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2000 mSDsluCounter, 8575 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3576 mSDsCounter, 529 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3145 IncrementalHoareTripleChecker+Invalid, 3674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 529 mSolverCounterUnsat, 4999 mSDtfsCounter, 3145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2810 GetRequests, 2767 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8266occurred in iteration=22, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 6034 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 252 NumberOfFragments, 668 HoareAnnotationTreeSize, 22 FomulaSimplifications, 13695 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 9821 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 7108 NumberOfCodeBlocks, 7108 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8265 ConstructedInterpolants, 0 QuantifiedInterpolants, 11104 SizeOfPredicates, 3 NumberOfNonLiveVariables, 6229 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 33 InterpolantComputations, 23 PerfectInterpolantSequences, 30892/30996 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: 176]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 && ~bvule32(4560bv32, s__state) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && s__state == 4400bv32) || blastFlag == 0bv32) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4560bv32, s__state))) || (~bvule32(blastFlag, 2bv32) && 4528bv32 == s__state)) || ((0bv32 == s__hit && 4512bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || (~bvule32(blastFlag, 2bv32) && 4512bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32))) || ((s__state == 4448bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4480bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && s__state == 4448bv32) && 0bv32 == s__hit)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && s__state == 4496bv32)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4512bv32 == s__state)) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4432bv32 == s__state)) || (~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 3bv32))) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(4352bv32, s__state)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32))) || ((s__state == 4416bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || ((0bv32 == s__hit && s__state == 4496bv32) && ~bvule32(blastFlag, 4bv32))) || ((0bv32 == s__hit && 4480bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && ~bvule32(s__state, 3bv32))) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4464bv32 == s__state)) || ((0bv32 == s__hit && 4528bv32 == s__state) && ~bvule32(blastFlag, 4bv32))) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4464bv32 == s__state)) || ((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && 4528bv32 == s__state)) || (blastFlag == 1bv32 && s__state == 4384bv32) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state)) || (((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32)) || ((blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && ~bvule32(s__state, 4352bv32))) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(4352bv32, s__state)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32)) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4352bv32, s__state)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4560bv32, s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(4560bv32, s__state)) && ~bvult64(s__state, 12292bv32)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state)) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state)) || (((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((blastFlag == 1bv32 && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvult64(4400bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvult64(4400bv32, s__state)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) || ((blastFlag == 0bv32 && ~bvule32(s__state, 4560bv32)) && ~bvule32(4432bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4432bv32, s__state)) && ~bvule32(blastFlag, 4bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 10:02:52,618 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...